%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL109-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:11:47 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 15 RR)
% Number of literals : 51 ( 19 equ; 19 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lemma_1,axiom,
( ~ ordered(X1,X2)
| ordered(implies(X1,X3),implies(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(partial_order_definition2,axiom,
( implies(X1,X2) != truth
| ordered(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',partial_order_definition2) ).
cnf(partial_order_definition1,axiom,
( ~ ordered(X1,X2)
| implies(X1,X2) = truth ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',partial_order_definition1) ).
cnf(lemma_3_1,axiom,
( ~ ordered(X1,implies(X2,X3))
| ordered(X2,implies(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(prove_mv_4,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_4) ).
cnf(big_V_definition,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',big_V_definition) ).
cnf(c_0_8,plain,
( ~ ordered(X1,X2)
| ordered(implies(X1,X3),implies(X2,X3)) ),
inference(fof_simplification,[status(thm)],[lemma_1]) ).
cnf(c_0_9,plain,
( ~ ordered(X1,X2)
| ordered(implies(X1,X3),implies(X2,X3)) ),
c_0_8 ).
cnf(c_0_10,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_11,plain,
( ~ ordered(X1,truth)
| ordered(implies(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( implies(X1,X2) != truth
| ordered(X1,X2) ),
inference(fof_simplification,[status(thm)],[partial_order_definition2]) ).
cnf(c_0_13,plain,
( ~ ordered(X1,X2)
| implies(X1,X2) = truth ),
inference(fof_simplification,[status(thm)],[partial_order_definition1]) ).
cnf(c_0_14,plain,
( ~ ordered(truth,truth)
| ordered(X1,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,plain,
( implies(X1,X2) != truth
| ordered(X1,X2) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ ordered(X1,X2)
| implies(X1,X2) = truth ),
c_0_13 ).
cnf(c_0_17,plain,
ordered(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]) ).
cnf(c_0_18,plain,
( ~ ordered(X1,implies(X2,X3))
| ordered(X2,implies(X1,X3)) ),
inference(fof_simplification,[status(thm)],[lemma_3_1]) ).
cnf(c_0_19,plain,
implies(X1,X1) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ ordered(X1,implies(X2,X3))
| ordered(X2,implies(X1,X3)) ),
c_0_18 ).
cnf(c_0_21,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_22,plain,
( ~ ordered(X2,X1)
| ordered(truth,implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_23,plain,
ordered(X1,implies(implies(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_19]) ).
cnf(c_0_25,plain,
( ~ ordered(X2,X1)
| ordered(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_10]) ).
cnf(c_0_26,plain,
ordered(X1,truth),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
ordered(truth,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
inference(fof_simplification,[status(thm)],[prove_mv_4]) ).
cnf(c_0_29,plain,
ordered(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_10]) ).
cnf(c_0_30,axiom,
big_V(X1,X2) = implies(implies(X1,X2),X2),
big_V_definition ).
cnf(c_0_31,negated_conjecture,
big_V(implies(x,y),implies(y,x)) != truth,
c_0_28 ).
cnf(c_0_32,plain,
implies(X1,X2) = truth,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_29])]) ).
cnf(c_0_33,plain,
big_V(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_10]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL109-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 00:07:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_3 with pid 2974269 completed with status 0
% 0.11/0.45 % Result found by new_bool_3
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 2974277 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 17
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 17
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 17
% 0.11/0.46 % Processed clauses : 53
% 0.11/0.46 % ...of these trivial : 5
% 0.11/0.46 % ...subsumed : 9
% 0.11/0.46 % ...remaining for further processing : 39
% 0.11/0.46 % Other redundant clauses eliminated : 1
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 4
% 0.11/0.46 % Backward-rewritten : 26
% 0.11/0.46 % Generated clauses : 209
% 0.11/0.46 % ...of the previous two non-redundant : 169
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 0
% 0.11/0.46 % Paramodulations : 208
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 1
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 133
% 0.11/0.46 % ...of those cached : 82
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 9
% 0.11/0.46 % Positive orientable unit clauses : 9
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 0
% 0.11/0.46 % Non-unit-clauses : 0
% 0.11/0.46 % Current number of unprocessed clauses: 126
% 0.11/0.46 % ...number of literals in the above : 210
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 30
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 49
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 49
% 0.11/0.46 % Non-unit clause-clause subsumptions : 9
% 0.11/0.46 % Unit Clause-clause subsumption calls : 12
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 61
% 0.11/0.46 % BW rewrite match successes : 36
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 1999
% 0.11/0.46 % Search garbage collected termcells : 11
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.005 s
% 0.11/0.46 % System time : 0.002 s
% 0.11/0.46 % Total time : 0.007 s
% 0.11/0.46 % Maximum resident set size: 3640 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.008 s
% 0.11/0.46 % System time : 0.005 s
% 0.11/0.46 % Total time : 0.013 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------