TSTP Solution File: LCL266-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL266-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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:20 EDT 2023
% Result : Unsatisfiable 41.32s 41.37s
% Output : CNFRefutation 41.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of formulae : 71 ( 29 unt; 10 typ; 0 def)
% Number of atoms : 105 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 99 ( 55 ~; 44 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 110 ( 3 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
or: ( $i * $i ) > $i ).
tff(decl_23,type,
implies: ( $i * $i ) > $i ).
tff(decl_24,type,
axiom: $i > $o ).
tff(decl_25,type,
not: $i > $i ).
tff(decl_26,type,
theorem: $i > $o ).
tff(decl_27,type,
and: ( $i * $i ) > $i ).
tff(decl_28,type,
equivalent: ( $i * $i ) > $i ).
tff(decl_29,type,
p: $i ).
tff(decl_30,type,
q: $i ).
tff(decl_31,type,
r: $i ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(not(r),not(q))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_19,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_21,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_23,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_24,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_25,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_28,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_30,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_31,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_32,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_33,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_36,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(not(r),not(q))))),
prove_this ).
cnf(c_0_38,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_12]),c_0_12]),c_0_32]) ).
cnf(c_0_39,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_40,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_41,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(not(or(not(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q))))))),not(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_12]),c_0_12]),c_0_32]),c_0_32]),c_0_38]) ).
cnf(c_0_43,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_44,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q)))))))
| ~ theorem(or(not(not(or(not(p),not(or(not(not(r)),not(q)))))),not(or(not(p),not(or(not(q),r)))))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(r)),not(q)))))))
| ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(r)),not(q)))))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(r)),not(q))))))
| ~ theorem(or(not(or(not(p),not(or(not(not(r)),not(q))))),or(not(p),not(or(not(q),r))))) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(r)),not(q))))))
| ~ theorem(or(not(not(or(not(not(r)),not(q)))),not(or(not(q),r)))) ),
inference(spm,[status(thm)],[c_0_48,c_0_34]) ).
cnf(c_0_50,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_51,negated_conjecture,
( ~ theorem(or(not(not(or(not(not(r)),not(q)))),not(or(not(q),r))))
| ~ theorem(or(not(not(or(not(q),r))),not(or(not(not(r)),not(q))))) ),
inference(spm,[status(thm)],[c_0_49,c_0_34]) ).
cnf(c_0_52,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_14]) ).
cnf(c_0_53,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ theorem(or(not(not(or(not(q),r))),not(or(not(not(r)),not(q)))))
| ~ theorem(or(not(or(not(q),r)),or(not(not(r)),not(q)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_55,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_56,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X4)))
| ~ theorem(or(not(X2),X4))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( ~ theorem(or(not(or(not(q),r)),or(not(not(r)),not(q))))
| ~ theorem(or(not(or(not(not(r)),not(q))),or(not(q),r))) ),
inference(spm,[status(thm)],[c_0_54,c_0_46]) ).
cnf(c_0_58,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X4)))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X4,X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(r)),not(q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_36]),c_0_41])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_41]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL266-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.32 % Computer : n002.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri Aug 25 05:27:32 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.53 start to proof: theBenchmark
% 41.32/41.37 % Version : CSE_E---1.5
% 41.32/41.37 % Problem : theBenchmark.p
% 41.32/41.37 % Proof found
% 41.32/41.37 % SZS status Theorem for theBenchmark.p
% 41.32/41.37 % SZS output start Proof
% See solution above
% 41.32/41.37 % Total time : 40.824000 s
% 41.32/41.37 % SZS output end Proof
% 41.32/41.37 % Total time : 40.828000 s
%------------------------------------------------------------------------------