%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL319-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:12:25 PM UTC 2026
% Result : Unsatisfiable 0.13s 20.86s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of clauses : 72 ( 36 unt; 0 nHn; 36 RR)
% Number of literals : 118 ( 7 equ; 54 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 141 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(and(p,q),equivalent(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(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,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,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_20,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_23,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_26,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_27,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_28,plain,
( ~ theorem(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_30,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_32,plain,
( ~ axiom(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_33,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_34,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_35,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_36,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_37,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(implies(and(p,q),equivalent(p,q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_40,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_41,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_42,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_44,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(implies(and(p,q),equivalent(p,q))),
c_0_39 ).
cnf(c_0_47,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_40,c_0_13]),c_0_13]),c_0_41]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_42]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_50,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(or(not(p),q)),not(or(not(q),p)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_13]),c_0_41]),c_0_47]) ).
cnf(c_0_52,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_48]) ).
cnf(c_0_53,plain,
( ~ theorem(or(not(X2),X3))
| ~ theorem(or(or(not(or(not(X1),X2)),X3),X1))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_49]) ).
cnf(c_0_54,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_55,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_50,c_0_30]) ).
cnf(c_0_56,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(p),not(q)))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( ~ theorem(or(or(X2,X2),X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_52]) ).
cnf(c_0_59,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_33,c_0_54]) ).
cnf(c_0_60,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_61,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_33,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(or(not(p),q),or(not(p),not(q))))
| ~ theorem(or(not(not(or(not(q),p))),or(not(p),not(q)))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( ~ theorem(or(X1,X2))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_54]) ).
cnf(c_0_64,plain,
( ~ theorem(or(or(or(or(X1,X2),X3),X3),X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_59]) ).
cnf(c_0_65,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ theorem(or(or(not(q),p),or(not(p),not(q))))
| ~ theorem(or(or(not(p),q),or(not(p),not(q)))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( ~ theorem(or(X2,X3))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_64,c_0_54]) ).
cnf(c_0_68,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ theorem(or(or(not(p),q),or(not(p),not(q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_70,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_35,c_0_61]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_38]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL319-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/20.38 % Computer : n012.cluster.edu
% 0.09/20.38 % Model : x86_64 x86_64
% 0.09/20.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/20.38 % Memory : 8046.5625MB
% 0.09/20.38 % OS : Linux 6.8.0-71-generic
% 0.09/20.38 % CPULimit : 300
% 0.09/20.38 % WCLimit : 300
% 0.09/20.38 % DateTime : Mon Sep 21 00:21:14 UTC 2026
% 0.09/20.39 % CPUTime :
% 0.09/20.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/20.43 Running first-order theorem proving
% 0.13/20.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/20.86 % Version: 3.5.1
% 0.13/20.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/20.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/20.86 % Starting new_bool_3 with 300s (1) cores
% 0.13/20.86 % Starting new_bool_1 with 300s (1) cores
% 0.13/20.86 % Starting sh5l with 300s (1) cores
% 0.13/20.86 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1217508 completed with status 0
% 0.13/20.86 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/20.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/20.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/20.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/20.86 % No SInE strategy applied
% 0.13/20.86 % Search class: FHUNM-FFSF21-DFFFFFNN
% 0.13/20.86 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/20.86 % Starting SubtermCWHack with 151s (1) cores
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.13/20.86 % Starting new_bool_3 with 329s (1) cores
% 0.13/20.86 % Starting new_bool_1 with 291s (1) cores
% 0.13/20.86 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1217516 completed with status 0
% 0.13/20.86 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.13/20.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/20.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/20.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/20.86 % No SInE strategy applied
% 0.13/20.86 % Search class: FHUNM-FFSF21-DFFFFFNN
% 0.13/20.86 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/20.86 % Starting SubtermCWHack with 151s (1) cores
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.13/20.86 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.13/20.86 % Preprocessing time : 0.017 s
% 0.13/20.86
% 0.13/20.86 % Proof found!
% 0.13/20.86 % SZS status Unsatisfiable
% 0.13/20.86 % SZS output start CNFRefutation
% See solution above
% 0.13/20.86 % Parsed axioms : 11
% 0.13/20.86 % Removed by relevancy pruning/SinE : 0
% 0.13/20.86 % Initial clauses : 11
% 0.13/20.86 % Removed in clause preprocessing : 3
% 0.13/20.86 % Initial clauses in saturation : 8
% 0.13/20.86 % Processed clauses : 2236
% 0.13/20.86 % ...of these trivial : 16
% 0.13/20.86 % ...subsumed : 1364
% 0.13/20.86 % ...remaining for further processing : 856
% 0.13/20.86 % Other redundant clauses eliminated : 0
% 0.13/20.86 % Clauses deleted for lack of memory : 0
% 0.13/20.86 % Backward-subsumed : 209
% 0.13/20.86 % Backward-rewritten : 11
% 0.13/20.86 % Generated clauses : 19457
% 0.13/20.86 % ...of the previous two non-redundant : 19059
% 0.13/20.86 % ...aggressively subsumed : 0
% 0.13/20.86 % Contextual simplify-reflections : 0
% 0.13/20.86 % Paramodulations : 19457
% 0.13/20.86 % Factorizations : 0
% 0.13/20.86 % NegExts : 0
% 0.13/20.86 % Equation resolutions : 0
% 0.13/20.86 % Disequality decompositions : 0
% 0.13/20.86 % Total rewrite steps : 309
% 0.13/20.86 % ...of those cached : 237
% 0.13/20.86 % Propositional unsat checks : 0
% 0.13/20.86 % Propositional check models : 0
% 0.13/20.86 % Propositional check unsatisfiable : 0
% 0.13/20.86 % Propositional clauses : 0
% 0.13/20.86 % Propositional clauses after purity: 0
% 0.13/20.86 % Propositional unsat core size : 0
% 0.13/20.86 % Propositional preprocessing time : 0.000
% 0.13/20.86 % Propositional encoding time : 0.000
% 0.13/20.86 % Propositional solver time : 0.000
% 0.13/20.86 % Success case prop preproc time : 0.000
% 0.13/20.86 % Success case prop encoding time : 0.000
% 0.13/20.86 % Success case prop solver time : 0.000
% 0.13/20.86 % Current number of processed clauses : 636
% 0.13/20.86 % Positive orientable unit clauses : 30
% 0.13/20.86 % Positive unorientable unit clauses: 0
% 0.13/20.86 % Negative unit clauses : 55
% 0.13/20.86 % Non-unit-clauses : 551
% 0.13/20.86 % Current number of unprocessed clauses: 16720
% 0.13/20.86 % ...number of literals in the above : 52853
% 0.13/20.86 % Current number of archived formulas : 0
% 0.13/20.86 % Current number of archived clauses : 223
% 0.13/20.86 % Clause-clause subsumption calls (NU) : 74061
% 0.13/20.86 % Rec. Clause-clause subsumption calls : 64888
% 0.13/20.86 % Non-unit clause-clause subsumptions : 1145
% 0.13/20.86 % Unit Clause-clause subsumption calls : 3761
% 0.13/20.86 % Rewrite failures with RHS unbound : 0
% 0.13/20.86 % BW rewrite match attempts : 972
% 0.13/20.86 % BW rewrite match successes : 4
% 0.13/20.86 % Condensation attempts : 0
% 0.13/20.86 % Condensation successes : 0
% 0.13/20.86 % Termbank termtop insertions : 317035
% 0.13/20.86 % Search garbage collected termcells : 11
% 0.13/20.86
% 0.13/20.86 % -------------------------------------------------
% 0.13/20.86 % User time : 0.352 s
% 0.13/20.86 % System time : 0.036 s
% 0.13/20.86 % Total time : 0.388 s
% 0.13/20.86 % Maximum resident set size: 3644 pages
% 0.13/20.86
% 0.13/20.86 % -------------------------------------------------
% 0.13/20.86 % User time : 1.859 s
% 0.13/20.86 % System time : 0.130 s
% 0.13/20.86 % Total time : 1.988 s
% 0.13/20.86 % Maximum resident set size: 4608 pages
% 0.13/20.86 % E exiting
%------------------------------------------------------------------------------