TSTP Solution File: LCL334-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL334-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 08:18:35 EDT 2024
% Result : Unsatisfiable 188.30s 24.40s
% Output : CNFRefutation 188.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 11
% Syntax : Number of clauses : 125 ( 47 unt; 0 nHn; 61 RR)
% Number of literals : 229 ( 7 equ; 117 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 14 ( 2 avg)
% 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 : 241 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(and(p,q),r)))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p',and_defn) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_19,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_20,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,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_17,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_27,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_28,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_37,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_38,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_39,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_40,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_41,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_42,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_44,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_46,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_47,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_48,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_50,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_51,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_16]) ).
cnf(c_0_53,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_50]) ).
cnf(c_0_54,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_55,plain,
( theorem(or(or(X1,X2),X3))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_57,plain,
( theorem(not(not(X1)))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_55,c_0_23]) ).
cnf(c_0_59,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(and(p,q),r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_60,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_61,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_62,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_63,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_52]) ).
cnf(c_0_64,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_49,c_0_26]) ).
cnf(c_0_65,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(not(not(or(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_66,plain,
theorem(not(not(or(not(X1),X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,negated_conjecture,
~ theorem(equivalent(and(p,implies(q,r)),and(p,implies(and(p,q),r)))),
c_0_59 ).
cnf(c_0_68,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_60,c_0_13]),c_0_13]),c_0_61]) ).
cnf(c_0_69,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_44]) ).
cnf(c_0_70,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_22]) ).
cnf(c_0_71,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_64]) ).
cnf(c_0_72,plain,
theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,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(or(not(p),not(q)))),r)))))),not(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),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)],[inference(rw,[status(thm)],[c_0_67,c_0_13]),c_0_13]),c_0_61]),c_0_61]),c_0_61]),c_0_68]) ).
cnf(c_0_74,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_71,c_0_16]) ).
cnf(c_0_76,plain,
( theorem(not(not(not(not(X1)))))
| ~ theorem(or(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_77,plain,
theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_25,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))))
| ~ theorem(or(not(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))),not(or(not(p),not(or(not(q),r)))))) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_80,plain,
( theorem(X1)
| ~ theorem(or(X1,or(X1,X2)))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_56]) ).
cnf(c_0_81,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_22]) ).
cnf(c_0_82,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_58]) ).
cnf(c_0_83,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_84,plain,
theorem(not(not(not(not(or(X1,not(X1))))))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),not(or(not(q),r))))),not(or(not(p),not(or(not(not(or(not(p),not(q)))),r))))))
| ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(or(not(p),not(q)))),r))))) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_86,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_49,c_0_82]) ).
cnf(c_0_88,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_89,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_90,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_49,c_0_77]) ).
cnf(c_0_91,plain,
theorem(or(not(not(or(X1,not(X1)))),X2)),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_92,negated_conjecture,
( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))
| ~ theorem(or(not(or(not(p),not(or(not(not(or(not(p),not(q)))),r)))),or(not(p),not(or(not(q),r))))) ),
inference(spm,[status(thm)],[c_0_85,c_0_79]) ).
cnf(c_0_93,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,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_27,c_0_88]) ).
cnf(c_0_95,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_96,plain,
( theorem(X1)
| ~ theorem(or(X1,not(or(X2,not(X2))))) ),
inference(spm,[status(thm)],[c_0_62,c_0_91]) ).
cnf(c_0_97,plain,
( theorem(or(or(X1,X2),not(or(X1,X3))))
| ~ theorem(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_98,negated_conjecture,
( ~ theorem(or(not(or(not(p),not(or(not(q),r)))),or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))
| ~ theorem(or(not(not(or(not(not(or(not(p),not(q)))),r))),not(or(not(q),r)))) ),
inference(spm,[status(thm)],[c_0_92,c_0_24]) ).
cnf(c_0_99,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_100,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_95]) ).
cnf(c_0_101,plain,
( theorem(X1)
| ~ theorem(or(X1,X2))
| ~ theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
cnf(c_0_102,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( ~ theorem(or(not(not(or(not(q),r))),or(not(p),not(or(not(not(or(not(p),not(q)))),r)))))
| ~ theorem(or(not(not(or(not(not(or(not(p),not(q)))),r))),not(or(not(q),r)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100])]) ).
cnf(c_0_104,plain,
( theorem(X1)
| ~ theorem(not(X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_101,c_0_33]) ).
cnf(c_0_105,plain,
( theorem(not(not(X1)))
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_16]) ).
cnf(c_0_106,plain,
theorem(or(X1,not(not(not(X1))))),
inference(spm,[status(thm)],[c_0_102,c_0_46]) ).
cnf(c_0_107,negated_conjecture,
( ~ theorem(or(or(not(p),not(or(not(not(or(not(p),not(q)))),r))),or(not(q),r)))
| ~ theorem(or(not(not(or(not(not(or(not(p),not(q)))),r))),not(or(not(q),r)))) ),
inference(spm,[status(thm)],[c_0_103,c_0_79]) ).
cnf(c_0_108,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_104,c_0_22]) ).
cnf(c_0_109,plain,
( theorem(not(not(or(X1,or(X2,X3)))))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_105,c_0_45]) ).
cnf(c_0_110,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X4))
| ~ axiom(or(X2,or(not(X4),X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_111,plain,
theorem(or(not(not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_106]) ).
cnf(c_0_112,negated_conjecture,
( ~ theorem(or(or(not(p),not(or(not(not(or(not(p),not(q)))),r))),or(not(q),r)))
| ~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))) ),
inference(spm,[status(thm)],[c_0_107,c_0_79]) ).
cnf(c_0_113,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_114,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),or(X4,X3))))
| ~ theorem(or(X1,or(X4,X2))) ),
inference(spm,[status(thm)],[c_0_110,c_0_21]) ).
cnf(c_0_115,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_116,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_111]) ).
cnf(c_0_117,negated_conjecture,
( ~ theorem(or(not(p),or(or(not(q),r),not(or(not(not(or(not(p),not(q)))),r)))))
| ~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_118,plain,
( theorem(or(X1,or(or(X2,X3),not(or(not(X4),X3)))))
| ~ theorem(or(X1,or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_89,c_0_114]) ).
cnf(c_0_119,plain,
theorem(or(X1,or(X2,not(or(X1,X2))))),
inference(spm,[status(thm)],[c_0_89,c_0_115]) ).
cnf(c_0_120,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(not(not(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_116,c_0_79]) ).
cnf(c_0_121,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119])]) ).
cnf(c_0_122,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_21]) ).
cnf(c_0_123,plain,
theorem(or(not(not(or(X1,not(X2)))),X2)),
inference(spm,[status(thm)],[c_0_120,c_0_87]) ).
cnf(c_0_124,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL334-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 08:50:04 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.KRpDoiF3lK/E---3.1_18925.p
% 188.30/24.40 # Version: 3.1.0
% 188.30/24.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 188.30/24.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 188.30/24.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 188.30/24.40 # Starting new_bool_3 with 300s (1) cores
% 188.30/24.40 # Starting new_bool_1 with 300s (1) cores
% 188.30/24.40 # Starting sh5l with 300s (1) cores
% 188.30/24.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19063 completed with status 0
% 188.30/24.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 188.30/24.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 188.30/24.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 188.30/24.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 188.30/24.40 # No SInE strategy applied
% 188.30/24.40 # Search class: FHUNM-FFSF21-DFFFFFNN
% 188.30/24.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 188.30/24.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 188.30/24.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 188.30/24.40 # Starting new_bool_3 with 296s (1) cores
% 188.30/24.40 # Starting new_bool_1 with 291s (1) cores
% 188.30/24.40 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 188.30/24.40 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19077 completed with status 0
% 188.30/24.40 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 188.30/24.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 188.30/24.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 188.30/24.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 188.30/24.40 # No SInE strategy applied
% 188.30/24.40 # Search class: FHUNM-FFSF21-DFFFFFNN
% 188.30/24.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 188.30/24.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 188.30/24.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 188.30/24.40 # Starting new_bool_3 with 296s (1) cores
% 188.30/24.40 # Starting new_bool_1 with 291s (1) cores
% 188.30/24.40 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 188.30/24.40 # Preprocessing time : 0.001 s
% 188.30/24.40 # Presaturation interreduction done
% 188.30/24.40
% 188.30/24.40 # Proof found!
% 188.30/24.40 # SZS status Unsatisfiable
% 188.30/24.40 # SZS output start CNFRefutation
% See solution above
% 188.30/24.40 # Parsed axioms : 11
% 188.30/24.40 # Removed by relevancy pruning/SinE : 0
% 188.30/24.40 # Initial clauses : 11
% 188.30/24.40 # Removed in clause preprocessing : 3
% 188.30/24.40 # Initial clauses in saturation : 8
% 188.30/24.40 # Processed clauses : 71690
% 188.30/24.40 # ...of these trivial : 288
% 188.30/24.40 # ...subsumed : 54563
% 188.30/24.40 # ...remaining for further processing : 16839
% 188.30/24.40 # Other redundant clauses eliminated : 0
% 188.30/24.40 # Clauses deleted for lack of memory : 0
% 188.30/24.40 # Backward-subsumed : 11995
% 188.30/24.40 # Backward-rewritten : 47
% 188.30/24.40 # Generated clauses : 840898
% 188.30/24.40 # ...of the previous two non-redundant : 826785
% 188.30/24.40 # ...aggressively subsumed : 0
% 188.30/24.40 # Contextual simplify-reflections : 288
% 188.30/24.40 # Paramodulations : 840898
% 188.30/24.40 # Factorizations : 0
% 188.30/24.40 # NegExts : 0
% 188.30/24.40 # Equation resolutions : 0
% 188.30/24.40 # Disequality decompositions : 0
% 188.30/24.40 # Total rewrite steps : 16289
% 188.30/24.40 # ...of those cached : 14262
% 188.30/24.40 # Propositional unsat checks : 3
% 188.30/24.40 # Propositional check models : 0
% 188.30/24.40 # Propositional check unsatisfiable : 0
% 188.30/24.40 # Propositional clauses : 0
% 188.30/24.40 # Propositional clauses after purity: 0
% 188.30/24.40 # Propositional unsat core size : 0
% 188.30/24.40 # Propositional preprocessing time : 0.000
% 188.30/24.40 # Propositional encoding time : 1.902
% 188.30/24.40 # Propositional solver time : 1.471
% 188.30/24.40 # Success case prop preproc time : 0.000
% 188.30/24.40 # Success case prop encoding time : 0.000
% 188.30/24.40 # Success case prop solver time : 0.000
% 188.30/24.40 # Current number of processed clauses : 4789
% 188.30/24.40 # Positive orientable unit clauses : 191
% 188.30/24.40 # Positive unorientable unit clauses: 0
% 188.30/24.40 # Negative unit clauses : 284
% 188.30/24.40 # Non-unit-clauses : 4314
% 188.30/24.40 # Current number of unprocessed clauses: 748788
% 188.30/24.40 # ...number of literals in the above : 2148035
% 188.30/24.40 # Current number of archived formulas : 0
% 188.30/24.40 # Current number of archived clauses : 12053
% 188.30/24.40 # Clause-clause subsumption calls (NU) : 36357493
% 188.30/24.40 # Rec. Clause-clause subsumption calls : 18086886
% 188.30/24.40 # Non-unit clause-clause subsumptions : 48579
% 188.30/24.40 # Unit Clause-clause subsumption calls : 311342
% 188.30/24.40 # Rewrite failures with RHS unbound : 0
% 188.30/24.40 # BW rewrite match attempts : 26953
% 188.30/24.40 # BW rewrite match successes : 22
% 188.30/24.40 # Condensation attempts : 0
% 188.30/24.40 # Condensation successes : 0
% 188.30/24.40 # Termbank termtop insertions : 32643958
% 188.30/24.40 # Search garbage collected termcells : 11
% 188.30/24.40
% 188.30/24.40 # -------------------------------------------------
% 188.30/24.40 # User time : 22.823 s
% 188.30/24.40 # System time : 0.521 s
% 188.30/24.40 # Total time : 23.344 s
% 188.30/24.40 # Maximum resident set size: 1692 pages
% 188.30/24.40
% 188.30/24.40 # -------------------------------------------------
% 188.30/24.40 # User time : 114.725 s
% 188.30/24.40 # System time : 1.929 s
% 188.30/24.40 # Total time : 116.654 s
% 188.30/24.40 # Maximum resident set size: 1704 pages
% 188.30/24.40 % E---3.1 exiting
% 188.30/24.40 % E exiting
%------------------------------------------------------------------------------