%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL004-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 : n004.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:31 PM UTC 2026
% Result : Unsatisfiable 1.66s 0.75s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 3
% Syntax : Number of clauses : 61 ( 42 unt; 0 nHn; 9 RR)
% Number of literals : 83 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 221 ( 115 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(or(not(X1),X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(an_CAMeredith,axiom,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X5)))),or(not(or(not(X4),X1)),or(X3,or(X5,X1))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_CAMeredith) ).
cnf(an_3,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_3) ).
cnf(c_0_3,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(or(not(X1),X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(or(not(X1),X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X5)))),or(not(or(not(X4),X1)),or(X3,or(X5,X1))))),
an_CAMeredith ).
cnf(c_0_6,plain,
( ~ is_a_theorem(or(not(or(not(X2),X5)),or(X3,or(X1,X4))))
| is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(or(not(or(not(X1),or(not(X2),X3))),or(not(or(not(X4),X2)),or(or(X5,X2),or(not(X2),X3))))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
is_a_theorem(or(not(or(not(or(X1,X2)),X3)),or(not(or(not(X4),X2)),or(or(not(X2),X5),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,X1))),or(not(or(not(X4),X1)),or(X5,or(X3,X1))))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(or(not(or(not(X2),X5)),or(X4,X2)))
| is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(or(not(or(not(X1),or(not(X2),or(X3,X2)))),or(X4,or(not(or(not(X5),X2)),or(not(X2),or(X3,X2)))))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(or(not(X5),or(not(X3),or(X4,X3))))
| is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(or(not(or(not(not(or(not(X1),X2))),X3)),or(X4,or(or(not(X2),or(X5,X2)),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(or(not(X4),or(X5,X4)),X3))))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X5)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2)))),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_17,plain,
is_a_theorem(or(not(or(not(or(not(X1),or(X2,X1))),X3)),or(not(X4),or(X4,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X3,X3))))),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_21,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X1),or(X1,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_22,plain,
is_a_theorem(or(not(or(not(X1),X1)),or(not(X1),or(X2,X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_23,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_23]) ).
cnf(c_0_25,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_24,c_0_5]) ).
cnf(c_0_26,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X3),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_25]) ).
cnf(c_0_27,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(not(X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_26]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(or(not(X1),X3))
| is_a_theorem(or(not(X1),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X2),or(X4,X2))))),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_30,plain,
is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(X4,or(not(X3),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_10,c_0_25]) ).
cnf(c_0_31,plain,
is_a_theorem(or(not(or(not(not(X1)),X2)),or(X3,or(or(X4,X1),X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_29]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(or(not(or(X5,X2)),X4))
| is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X4))) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(or(not(X4),or(X3,X2)))
| is_a_theorem(or(X1,or(not(X2),or(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_30]) ).
cnf(c_0_34,plain,
is_a_theorem(or(not(or(not(or(X1,X2)),not(X2))),or(X3,or(X4,not(X2))))),
inference(spm,[status(thm)],[c_0_6,c_0_31]) ).
cnf(c_0_35,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),or(not(or(not(X4),X5)),or(or(not(X5),X6),X2))))),
inference(spm,[status(thm)],[c_0_32,c_0_8]) ).
cnf(c_0_36,plain,
is_a_theorem(or(X1,or(not(or(X2,not(X3))),or(X4,or(X2,not(X3)))))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(or(not(X6),X1))
| is_a_theorem(or(or(not(X1),X2),or(not(or(not(X3),X4)),or(or(not(X4),X5),X1)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_35]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_36]) ).
cnf(c_0_39,plain,
is_a_theorem(or(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X2)))),X5),or(not(or(not(X6),X7)),or(or(not(X7),X8),or(not(or(not(X1),X2)),or(X3,or(X4,X2))))))),
inference(spm,[status(thm)],[c_0_37,c_0_5]) ).
cnf(c_0_40,plain,
is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(not(X3),X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_40]) ).
cnf(c_0_42,plain,
is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(X4,or(not(X2),X3))))),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_42]) ).
cnf(c_0_44,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_45,plain,
is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(X3,X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_44]) ).
cnf(c_0_46,plain,
is_a_theorem(or(X1,or(not(or(X2,X3)),or(X4,or(X2,X3))))),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_46]) ).
cnf(c_0_48,plain,
is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))),
inference(spm,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_49,plain,
is_a_theorem(or(not(or(X1,X2)),or(X3,or(X4,or(X1,X2))))),
inference(spm,[status(thm)],[c_0_28,c_0_48]) ).
cnf(c_0_50,plain,
is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(or(not(X2),X4),X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_49]) ).
cnf(c_0_51,plain,
is_a_theorem(or(not(or(not(or(not(X1),X2)),X3)),or(X4,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_50]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(or(not(or(not(X2),X4)),X3))
| is_a_theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_51]) ).
cnf(c_0_53,plain,
is_a_theorem(or(X1,or(X2,or(not(X3),or(X4,X3))))),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_54,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(or(X1,or(not(X2),or(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
inference(fof_simplification,[status(thm)],[an_3]) ).
cnf(c_0_56,plain,
is_a_theorem(or(X1,or(not(X2),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_54,c_0_39]) ).
cnf(c_0_57,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
c_0_55 ).
cnf(c_0_58,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(or(not(X1),or(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
~ is_a_theorem(X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.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 : Sun Sep 20 23:59:35 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/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
% 1.66/0.75 % Version: 3.5.1
% 1.66/0.75 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.66/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.75 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.66/0.75 % Starting new_bool_3 with 300s (1) cores
% 1.66/0.75 % Starting new_bool_1 with 300s (1) cores
% 1.66/0.75 % Starting sh5l with 300s (1) cores
% 1.66/0.75 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1822276 completed with status 0
% 1.66/0.75 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.66/0.75 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.66/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.75 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.66/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.66/0.75 % No SInE strategy applied
% 1.66/0.75 % Search class: FHUNF-FFSF21-DFFFFFNN
% 1.66/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.66/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.66/0.75 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.66/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 136s (1) cores
% 1.66/0.75 % Starting new_bool_3 with 136s (1) cores
% 1.66/0.75 % Starting new_bool_1 with 136s (1) cores
% 1.66/0.75 % new_bool_1 with pid 1822285 completed with status 0
% 1.66/0.75 % Result found by new_bool_1
% 1.66/0.75 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.66/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.75 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.66/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.66/0.75 % No SInE strategy applied
% 1.66/0.75 % Search class: FHUNF-FFSF21-DFFFFFNN
% 1.66/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.66/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.66/0.75 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.66/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 136s (1) cores
% 1.66/0.75 % Starting new_bool_3 with 136s (1) cores
% 1.66/0.75 % Starting new_bool_1 with 136s (1) cores
% 1.66/0.75 % Preprocessing time : 0.002 s
% 1.66/0.75 % Presaturation interreduction done
% 1.66/0.75
% 1.66/0.75 % Proof found!
% 1.66/0.75 % SZS status Unsatisfiable
% 1.66/0.75 % SZS output start CNFRefutation
% See solution above
% 1.66/0.75 % Parsed axioms : 3
% 1.66/0.75 % Removed by relevancy pruning/SinE : 0
% 1.66/0.75 % Initial clauses : 3
% 1.66/0.75 % Removed in clause preprocessing : 0
% 1.66/0.75 % Initial clauses in saturation : 3
% 1.66/0.75 % Processed clauses : 676
% 1.66/0.75 % ...of these trivial : 18
% 1.66/0.75 % ...subsumed : 199
% 1.66/0.75 % ...remaining for further processing : 459
% 1.66/0.75 % Other redundant clauses eliminated : 0
% 1.66/0.75 % Clauses deleted for lack of memory : 0
% 1.66/0.75 % Backward-subsumed : 285
% 1.66/0.75 % Backward-rewritten : 72
% 1.66/0.75 % Generated clauses : 7513
% 1.66/0.75 % ...of the previous two non-redundant : 6900
% 1.66/0.75 % ...aggressively subsumed : 0
% 1.66/0.75 % Contextual simplify-reflections : 0
% 1.66/0.75 % Paramodulations : 7415
% 1.66/0.75 % Factorizations : 0
% 1.66/0.75 % NegExts : 0
% 1.66/0.75 % Equation resolutions : 0
% 1.66/0.75 % Disequality decompositions : 0
% 1.66/0.75 % Total rewrite steps : 623
% 1.66/0.75 % ...of those cached : 242
% 1.66/0.75 % Propositional unsat checks : 0
% 1.66/0.75 % Propositional check models : 0
% 1.66/0.75 % Propositional check unsatisfiable : 0
% 1.66/0.75 % Propositional clauses : 0
% 1.66/0.75 % Propositional clauses after purity: 0
% 1.66/0.75 % Propositional unsat core size : 0
% 1.66/0.75 % Propositional preprocessing time : 0.000
% 1.66/0.75 % Propositional encoding time : 0.000
% 1.66/0.75 % Propositional solver time : 0.000
% 1.66/0.75 % Success case prop preproc time : 0.000
% 1.66/0.75 % Success case prop encoding time : 0.000
% 1.66/0.75 % Success case prop solver time : 0.000
% 1.66/0.75 % Current number of processed clauses : 1
% 1.66/0.75 % Positive orientable unit clauses : 0
% 1.66/0.75 % Positive unorientable unit clauses: 0
% 1.66/0.75 % Negative unit clauses : 1
% 1.66/0.75 % Non-unit-clauses : 0
% 1.66/0.75 % Current number of unprocessed clauses: 5087
% 1.66/0.75 % ...number of literals in the above : 8210
% 1.66/0.75 % Current number of archived formulas : 0
% 1.66/0.75 % Current number of archived clauses : 458
% 1.66/0.75 % Clause-clause subsumption calls (NU) : 13739
% 1.66/0.75 % Rec. Clause-clause subsumption calls : 13432
% 1.66/0.75 % Non-unit clause-clause subsumptions : 412
% 1.66/0.75 % Unit Clause-clause subsumption calls : 2221
% 1.66/0.75 % Rewrite failures with RHS unbound : 0
% 1.66/0.75 % BW rewrite match attempts : 10770
% 1.66/0.75 % BW rewrite match successes : 87
% 1.66/0.75 % Condensation attempts : 0
% 1.66/0.75 % Condensation successes : 0
% 1.66/0.75 % Termbank termtop insertions : 137316
% 1.66/0.75 % Search garbage collected termcells : 8
% 1.66/0.75
% 1.66/0.75 % -------------------------------------------------
% 1.66/0.75 % User time : 0.236 s
% 1.66/0.75 % System time : 0.016 s
% 1.66/0.75 % Total time : 0.252 s
% 1.66/0.75 % Maximum resident set size: 3636 pages
% 1.66/0.75
% 1.66/0.75 % -------------------------------------------------
% 1.66/0.75 % User time : 1.014 s
% 1.66/0.75 % System time : 0.073 s
% 1.66/0.75 % Total time : 1.087 s
% 1.66/0.75 % Maximum resident set size: 4864 pages
% 1.66/0.75 % E exiting
%------------------------------------------------------------------------------