%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL113-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:18:31 PM UTC 2026
% Result : Unsatisfiable 183.26s 37.24s
% Output : CNFRefutation 183.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 4 RR)
% Number of literals : 44 ( 43 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 104 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_33,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_33) ).
cnf(c_0_7,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
mv_1 ).
cnf(c_0_9,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
mv_2 ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_13,plain,
ifeq(is_a_theorem(implies(implies(X1,X2),X3)),true,is_a_theorem(implies(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_9]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
mv_3 ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
mv_5 ).
cnf(c_0_17,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_9]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_9]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(not(X1),implies(X1,X2)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]) ).
cnf(c_0_21,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),not(X2)),implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_9]) ).
cnf(c_0_24,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X2,X3),implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(X1,X2),X2)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_9]) ).
cnf(c_0_27,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(X1,implies(X2,X1)),X3),X3),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_23]),c_0_9]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(not(X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_9]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_9]) ).
cnf(c_0_30,plain,
ifeq(is_a_theorem(implies(not(X1),not(X2))),true,is_a_theorem(implies(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(X1)),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_9]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_9]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_9]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,not(not(X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_9]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_9]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(implies(implies(X1,not(not(X1))),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_34]),c_0_9]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_9]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_9]) ).
cnf(c_0_39,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
inference(fof_simplification,[status(thm)],[prove_mv_33]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(implies(X1,not(not(X2))),X3),implies(implies(X1,X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_38]),c_0_9]) ).
cnf(c_0_41,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
c_0_39 ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_40]),c_0_9]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL113-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:06:39 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.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
% 183.26/37.24 % Version: 3.5.1
% 183.26/37.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.26/37.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.26/37.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.26/37.24 % Starting new_bool_3 with 300s (1) cores
% 183.26/37.24 % Starting new_bool_1 with 300s (1) cores
% 183.26/37.24 % Starting sh5l with 300s (1) cores
% 183.26/37.24 % new_bool_3 with pid 3929190 completed with status 9
% 183.26/37.24 % new_bool_1 with pid 3929191 completed with status 9
% 183.26/37.24 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3929189 completed with status 0
% 183.26/37.24 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 183.26/37.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.26/37.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.26/37.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.26/37.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.26/37.24 % No SInE strategy applied
% 183.26/37.24 % Search class: FUUPM-FFSF32-MFFFFFNN
% 183.26/37.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.26/37.24 % Starting SubtermCWHack with 136s (1) cores
% 183.26/37.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 183.26/37.24 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 183.26/37.24 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 183.26/37.24 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 183.26/37.24 % SubtermCWHack with pid 3929193 completed with status 0
% 183.26/37.24 % Result found by SubtermCWHack
% 183.26/37.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.26/37.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.26/37.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.26/37.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.26/37.24 % No SInE strategy applied
% 183.26/37.24 % Search class: FUUPM-FFSF32-MFFFFFNN
% 183.26/37.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.26/37.24 % Starting SubtermCWHack with 136s (1) cores
% 183.26/37.24 % Preprocessing time : 0.001 s
% 183.26/37.24
% 183.26/37.24 % Proof found!
% 183.26/37.24 % SZS status Unsatisfiable
% 183.26/37.24 % SZS output start CNFRefutation
% See solution above
% 183.26/37.24 % Parsed axioms : 7
% 183.26/37.24 % Removed by relevancy pruning/SinE : 0
% 183.26/37.24 % Initial clauses : 7
% 183.26/37.24 % Removed in clause preprocessing : 0
% 183.26/37.24 % Initial clauses in saturation : 7
% 183.26/37.24 % Processed clauses : 8114
% 183.26/37.24 % ...of these trivial : 3876
% 183.26/37.24 % ...subsumed : 0
% 183.26/37.24 % ...remaining for further processing : 4238
% 183.26/37.24 % Other redundant clauses eliminated : 0
% 183.26/37.24 % Clauses deleted for lack of memory : 0
% 183.26/37.24 % Backward-subsumed : 0
% 183.26/37.24 % Backward-rewritten : 10
% 183.26/37.24 % Generated clauses : 1309630
% 183.26/37.24 % ...of the previous two non-redundant : 298675
% 183.26/37.24 % ...aggressively subsumed : 0
% 183.26/37.24 % Contextual simplify-reflections : 0
% 183.26/37.24 % Paramodulations : 1309630
% 183.26/37.24 % Factorizations : 0
% 183.26/37.24 % NegExts : 0
% 183.26/37.24 % Equation resolutions : 0
% 183.26/37.24 % Disequality decompositions : 0
% 183.26/37.24 % Total rewrite steps : 1527472
% 183.26/37.24 % ...of those cached : 719923
% 183.26/37.24 % Propositional unsat checks : 0
% 183.26/37.24 % Propositional check models : 0
% 183.26/37.24 % Propositional check unsatisfiable : 0
% 183.26/37.24 % Propositional clauses : 0
% 183.26/37.24 % Propositional clauses after purity: 0
% 183.26/37.24 % Propositional unsat core size : 0
% 183.26/37.24 % Propositional preprocessing time : 0.000
% 183.26/37.24 % Propositional encoding time : 0.000
% 183.26/37.24 % Propositional solver time : 0.000
% 183.26/37.24 % Success case prop preproc time : 0.000
% 183.26/37.24 % Success case prop encoding time : 0.000
% 183.26/37.24 % Success case prop solver time : 0.000
% 183.26/37.24 % Current number of processed clauses : 4228
% 183.26/37.24 % Positive orientable unit clauses : 4228
% 183.26/37.24 % Positive unorientable unit clauses: 0
% 183.26/37.24 % Negative unit clauses : 0
% 183.26/37.24 % Non-unit-clauses : 0
% 183.26/37.24 % Current number of unprocessed clauses: 290547
% 183.26/37.24 % ...number of literals in the above : 290547
% 183.26/37.24 % Current number of archived formulas : 0
% 183.26/37.24 % Current number of archived clauses : 10
% 183.26/37.24 % Clause-clause subsumption calls (NU) : 0
% 183.26/37.24 % Rec. Clause-clause subsumption calls : 0
% 183.26/37.24 % Non-unit clause-clause subsumptions : 0
% 183.26/37.24 % Unit Clause-clause subsumption calls : 0
% 183.26/37.24 % Rewrite failures with RHS unbound : 0
% 183.26/37.24 % BW rewrite match attempts : 1878120
% 183.26/37.24 % BW rewrite match successes : 10
% 183.26/37.24 % Condensation attempts : 0
% 183.26/37.24 % Condensation successes : 0
% 183.26/37.24 % Termbank termtop insertions : 24079825
% 183.26/37.24 % Search garbage collected termcells : 2
% 183.26/37.24
% 183.26/37.24 % -------------------------------------------------
% 183.26/37.24 % User time : 35.612 s
% 183.26/37.24 % System time : 0.850 s
% 183.26/37.24 % Total time : 36.463 s
% 183.26/37.24 % Maximum resident set size: 3636 pages
% 183.26/37.24
% 183.26/37.24 % -------------------------------------------------
% 183.26/37.24 % User time : 178.640 s
% 183.26/37.24 % System time : 4.484 s
% 183.26/37.24 % Total time : 183.125 s
% 183.26/37.24 % Maximum resident set size: 4608 pages
% 183.26/37.24 % E exiting
%------------------------------------------------------------------------------