%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL144-1 : 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 : n013.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:53 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.55s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 11 unt; 4 nHn; 18 RR)
% Number of literals : 41 ( 22 equ; 17 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
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(prove_wajsberg_theorem,negated_conjecture,
( ~ ordered(y,implies(x,z))
| ~ ordered(x,implies(y,z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_theorem) ).
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(antecedent,negated_conjecture,
( ordered(y,implies(x,z))
| ordered(x,implies(y,z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antecedent) ).
cnf(c_0_6,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_7,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_8,plain,
( ~ ordered(X1,X2)
| implies(X1,X2) = truth ),
inference(fof_simplification,[status(thm)],[partial_order_definition1]) ).
cnf(c_0_9,negated_conjecture,
( ~ ordered(y,implies(x,z))
| ~ ordered(x,implies(y,z)) ),
inference(fof_simplification,[status(thm)],[prove_wajsberg_theorem]) ).
cnf(c_0_10,plain,
( implies(X1,X2) != truth
| ordered(X1,X2) ),
inference(fof_simplification,[status(thm)],[partial_order_definition2]) ).
cnf(c_0_11,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_12,plain,
( ~ ordered(X1,X2)
| implies(X1,X2) = truth ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
( ordered(y,implies(x,z))
| ordered(x,implies(y,z)) ),
antecedent ).
cnf(c_0_14,negated_conjecture,
( ~ ordered(y,implies(x,z))
| ~ ordered(x,implies(y,z)) ),
c_0_9 ).
cnf(c_0_15,plain,
( implies(X1,X2) != truth
| ordered(X1,X2) ),
c_0_10 ).
cnf(c_0_16,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_7]) ).
cnf(c_0_17,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ordered(x,implies(y,z))
| implies(y,implies(x,z)) = truth ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ ordered(x,implies(y,z))
| implies(y,implies(x,z)) != truth ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( implies(x,implies(y,z)) = truth
| implies(y,implies(x,z)) = truth ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( implies(x,implies(y,z)) != truth
| implies(y,implies(x,z)) != truth ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
implies(x,implies(y,z)) = truth,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_7])]) ).
cnf(c_0_24,negated_conjecture,
implies(y,implies(x,z)) != truth,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_7]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL144-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 00:06:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.15/0.55 % Version: 3.5.1
% 0.15/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.55 % Starting sh5l with 300s (1) cores
% 0.15/0.55 % new_bool_1 with pid 3742993 completed with status 0
% 0.15/0.55 % Result found by new_bool_1
% 0.15/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.55 % Search class: FGHSS-FFSF22-MFFFFFNN
% 0.15/0.55 % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.55 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.55 % SubtermCWHack with pid 3742999 completed with status 0
% 0.15/0.55 % Result found by SubtermCWHack
% 0.15/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.55 % Search class: FGHSS-FFSF22-MFFFFFNN
% 0.15/0.55 % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.55 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.55 % Preprocessing time : 0.002 s
% 0.15/0.55
% 0.15/0.55 % Proof found!
% 0.15/0.55 % SZS status Unsatisfiable
% 0.15/0.55 % SZS output start CNFRefutation
% See solution above
% 0.15/0.56 % Parsed axioms : 10
% 0.15/0.56 % Removed by relevancy pruning/SinE : 3
% 0.15/0.56 % Initial clauses : 7
% 0.15/0.56 % Removed in clause preprocessing : 0
% 0.15/0.56 % Initial clauses in saturation : 7
% 0.15/0.56 % Processed clauses : 131
% 0.15/0.56 % ...of these trivial : 71
% 0.15/0.56 % ...subsumed : 6
% 0.15/0.56 % ...remaining for further processing : 53
% 0.15/0.56 % Other redundant clauses eliminated : 0
% 0.15/0.56 % Clauses deleted for lack of memory : 0
% 0.15/0.56 % Backward-subsumed : 1
% 0.15/0.56 % Backward-rewritten : 6
% 0.15/0.56 % Generated clauses : 4624
% 0.15/0.56 % ...of the previous two non-redundant : 1702
% 0.15/0.56 % ...aggressively subsumed : 0
% 0.15/0.56 % Contextual simplify-reflections : 0
% 0.15/0.56 % Paramodulations : 4623
% 0.15/0.56 % Factorizations : 0
% 0.15/0.56 % NegExts : 0
% 0.15/0.56 % Equation resolutions : 0
% 0.15/0.56 % Disequality decompositions : 0
% 0.15/0.56 % Total rewrite steps : 8004
% 0.15/0.56 % ...of those cached : 5951
% 0.15/0.56 % Propositional unsat checks : 0
% 0.15/0.56 % Propositional check models : 0
% 0.15/0.56 % Propositional check unsatisfiable : 0
% 0.15/0.56 % Propositional clauses : 0
% 0.15/0.56 % Propositional clauses after purity: 0
% 0.15/0.56 % Propositional unsat core size : 0
% 0.15/0.56 % Propositional preprocessing time : 0.000
% 0.15/0.56 % Propositional encoding time : 0.000
% 0.15/0.56 % Propositional solver time : 0.000
% 0.15/0.56 % Success case prop preproc time : 0.000
% 0.15/0.56 % Success case prop encoding time : 0.000
% 0.15/0.56 % Success case prop solver time : 0.000
% 0.15/0.56 % Current number of processed clauses : 45
% 0.15/0.56 % Positive orientable unit clauses : 40
% 0.15/0.56 % Positive unorientable unit clauses: 1
% 0.15/0.56 % Negative unit clauses : 2
% 0.15/0.56 % Non-unit-clauses : 2
% 0.15/0.56 % Current number of unprocessed clauses: 1562
% 0.15/0.56 % ...number of literals in the above : 1599
% 0.15/0.56 % Current number of archived formulas : 0
% 0.15/0.56 % Current number of archived clauses : 8
% 0.15/0.56 % Clause-clause subsumption calls (NU) : 4
% 0.15/0.56 % Rec. Clause-clause subsumption calls : 4
% 0.15/0.56 % Non-unit clause-clause subsumptions : 0
% 0.15/0.56 % Unit Clause-clause subsumption calls : 16
% 0.15/0.56 % Rewrite failures with RHS unbound : 0
% 0.15/0.56 % BW rewrite match attempts : 179
% 0.15/0.56 % BW rewrite match successes : 5
% 0.15/0.56 % Condensation attempts : 0
% 0.15/0.56 % Condensation successes : 0
% 0.15/0.56 % Termbank termtop insertions : 46460
% 0.15/0.56 % Search garbage collected termcells : 18
% 0.15/0.56
% 0.15/0.56 % -------------------------------------------------
% 0.15/0.56 % User time : 0.070 s
% 0.15/0.56 % System time : 0.008 s
% 0.15/0.56 % Total time : 0.078 s
% 0.15/0.56 % Maximum resident set size: 3588 pages
% 0.15/0.56
% 0.15/0.56 % -------------------------------------------------
% 0.15/0.56 % User time : 0.072 s
% 0.15/0.56 % System time : 0.014 s
% 0.15/0.56 % Total time : 0.086 s
% 0.15/0.56 % Maximum resident set size: 4864 pages
% 0.15/0.56 % E exiting
%------------------------------------------------------------------------------