TSTP Solution File: LCL231-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL231-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 06:53:06 EDT 2023
% Result : Unsatisfiable 0.14s 0.60s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 26 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 3 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
or: ( $i * $i ) > $i ).
tff(decl_23,type,
not: $i > $i ).
tff(decl_24,type,
axiom: $i > $o ).
tff(decl_25,type,
theorem: $i > $o ).
tff(decl_26,type,
p: $i ).
tff(decl_27,type,
q: $i ).
tff(decl_28,type,
r: $i ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_0_8,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_9,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_11,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3 ).
cnf(c_0_12,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_15,plain,
( theorem(or(not(X1),or(X2,X3)))
| ~ theorem(or(not(X4),X3))
| ~ axiom(or(not(X1),or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_19,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
prove_this ).
cnf(c_0_20,plain,
( theorem(or(not(or(X1,or(X2,X3))),or(X2,X4)))
| ~ theorem(or(not(or(X1,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,plain,
( theorem(or(not(X1),or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ axiom(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_22,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_24,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),r)),or(not(q),r))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( theorem(or(not(or(not(X1),X2)),or(not(X3),X4)))
| ~ theorem(or(not(X2),X4))
| ~ axiom(or(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_26,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL231-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Fri Aug 25 05:59:57 EDT 2023
% 0.10/0.29 % CPUTime :
% 0.14/0.48 start to proof: theBenchmark
% 0.14/0.60 % Version : CSE_E---1.5
% 0.14/0.60 % Problem : theBenchmark.p
% 0.14/0.60 % Proof found
% 0.14/0.60 % SZS status Theorem for theBenchmark.p
% 0.14/0.60 % SZS output start Proof
% See solution above
% 0.14/0.61 % Total time : 0.116000 s
% 0.14/0.61 % SZS output end Proof
% 0.14/0.61 % Total time : 0.118000 s
%------------------------------------------------------------------------------