%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL273-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 : n015.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:20 PM UTC 2026
% Result : Unsatisfiable 14.08s 2.39s
% Output : CNFRefutation 14.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 55 ( 31 unt; 0 nHn; 28 RR)
% Number of literals : 89 ( 7 equ; 40 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 100 ( 3 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_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_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
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_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(and(p,q),and(q,p))),
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(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
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(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_13]) ).
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,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
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_13]),c_0_13]),c_0_13]) ).
cnf(c_0_29,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_30,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ theorem(equivalent(and(p,q),and(q,p))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_35,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_36,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_37,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(equivalent(and(p,q),and(q,p))),
c_0_34 ).
cnf(c_0_42,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_35,c_0_13]),c_0_13]),c_0_36]) ).
cnf(c_0_43,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(not(or(not(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),not(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_36]),c_0_36]),c_0_42]) ).
cnf(c_0_47,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_50,negated_conjecture,
( ~ theorem(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q)))))
| ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_52,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_53,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL273-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n015.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 00:20:50 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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
% 14.08/2.39 % Version: 3.5.1
% 14.08/2.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.08/2.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.08/2.39 % Starting new_bool_3 with 300s (1) cores
% 14.08/2.39 % Starting new_bool_1 with 300s (1) cores
% 14.08/2.39 % Starting sh5l with 300s (1) cores
% 14.08/2.39 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 152874 completed with status 0
% 14.08/2.39 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 14.08/2.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.08/2.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.08/2.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.08/2.39 % No SInE strategy applied
% 14.08/2.39 % Search class: FHUNM-FFSF21-DFFFFFNN
% 14.08/2.39 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 14.08/2.39 % Starting SubtermCWHack with 151s (1) cores
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 14.08/2.39 % Starting new_bool_3 with 329s (1) cores
% 14.08/2.39 % Starting new_bool_1 with 291s (1) cores
% 14.08/2.39 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 152880 completed with status 0
% 14.08/2.39 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 14.08/2.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.08/2.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.08/2.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.08/2.39 % No SInE strategy applied
% 14.08/2.39 % Search class: FHUNM-FFSF21-DFFFFFNN
% 14.08/2.39 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 14.08/2.39 % Starting SubtermCWHack with 151s (1) cores
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 14.08/2.39 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 14.08/2.39 % Preprocessing time : 0.071 s
% 14.08/2.39
% 14.08/2.39 % Proof found!
% 14.08/2.39 % SZS status Unsatisfiable
% 14.08/2.39 % SZS output start CNFRefutation
% See solution above
% 14.08/2.39 % Parsed axioms : 11
% 14.08/2.39 % Removed by relevancy pruning/SinE : 0
% 14.08/2.39 % Initial clauses : 11
% 14.08/2.39 % Removed in clause preprocessing : 3
% 14.08/2.39 % Initial clauses in saturation : 8
% 14.08/2.39 % Processed clauses : 3424
% 14.08/2.39 % ...of these trivial : 13
% 14.08/2.39 % ...subsumed : 2082
% 14.08/2.39 % ...remaining for further processing : 1329
% 14.08/2.39 % Other redundant clauses eliminated : 0
% 14.08/2.39 % Clauses deleted for lack of memory : 0
% 14.08/2.39 % Backward-subsumed : 493
% 14.08/2.39 % Backward-rewritten : 2
% 14.08/2.39 % Generated clauses : 42495
% 14.08/2.39 % ...of the previous two non-redundant : 42031
% 14.08/2.39 % ...aggressively subsumed : 0
% 14.08/2.39 % Contextual simplify-reflections : 5
% 14.08/2.39 % Paramodulations : 42495
% 14.08/2.39 % Factorizations : 0
% 14.08/2.39 % NegExts : 0
% 14.08/2.39 % Equation resolutions : 0
% 14.08/2.39 % Disequality decompositions : 0
% 14.08/2.39 % Total rewrite steps : 402
% 14.08/2.39 % ...of those cached : 324
% 14.08/2.39 % Propositional unsat checks : 0
% 14.08/2.39 % Propositional check models : 0
% 14.08/2.39 % Propositional check unsatisfiable : 0
% 14.08/2.39 % Propositional clauses : 0
% 14.08/2.39 % Propositional clauses after purity: 0
% 14.08/2.39 % Propositional unsat core size : 0
% 14.08/2.39 % Propositional preprocessing time : 0.000
% 14.08/2.39 % Propositional encoding time : 0.000
% 14.08/2.39 % Propositional solver time : 0.000
% 14.08/2.39 % Success case prop preproc time : 0.000
% 14.08/2.39 % Success case prop encoding time : 0.000
% 14.08/2.39 % Success case prop solver time : 0.000
% 14.08/2.39 % Current number of processed clauses : 834
% 14.08/2.39 % Positive orientable unit clauses : 30
% 14.08/2.39 % Positive unorientable unit clauses: 0
% 14.08/2.39 % Negative unit clauses : 44
% 14.08/2.39 % Non-unit-clauses : 760
% 14.08/2.39 % Current number of unprocessed clauses: 38483
% 14.08/2.39 % ...number of literals in the above : 125417
% 14.08/2.39 % Current number of archived formulas : 0
% 14.08/2.39 % Current number of archived clauses : 498
% 14.08/2.39 % Clause-clause subsumption calls (NU) : 167161
% 14.08/2.39 % Rec. Clause-clause subsumption calls : 131855
% 14.08/2.39 % Non-unit clause-clause subsumptions : 2089
% 14.08/2.39 % Unit Clause-clause subsumption calls : 4179
% 14.08/2.39 % Rewrite failures with RHS unbound : 0
% 14.08/2.39 % BW rewrite match attempts : 1203
% 14.08/2.39 % BW rewrite match successes : 4
% 14.08/2.39 % Condensation attempts : 0
% 14.08/2.39 % Condensation successes : 0
% 14.08/2.39 % Termbank termtop insertions : 786104
% 14.08/2.39 % Search garbage collected termcells : 11
% 14.08/2.39
% 14.08/2.39 % -------------------------------------------------
% 14.08/2.39 % User time : 1.722 s
% 14.08/2.39 % System time : 0.066 s
% 14.08/2.39 % Total time : 1.787 s
% 14.08/2.39 % Maximum resident set size: 3644 pages
% 14.08/2.39
% 14.08/2.39 % -------------------------------------------------
% 14.08/2.39 % User time : 8.472 s
% 14.08/2.39 % System time : 0.347 s
% 14.08/2.39 % Total time : 8.819 s
% 14.08/2.39 % Maximum resident set size: 4864 pages
% 14.08/2.39 % E exiting
%------------------------------------------------------------------------------