%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL100-1 : TPTP v9.3.1. Released v2.7.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 12:09:37 PM UTC 2026
% Result : Unsatisfiable 0.64s 0.51s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 15 unt; 0 nHn; 37 RR)
% Number of literals : 81 ( 0 equ; 46 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 59 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(diamond_strip_lemmaD2,axiom,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_strip_lemmaD2) ).
cnf(diamond_trancl_2h4,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(ya,sk1(X1)),trancl(r)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2h4) ).
cnf(diamond_trancl_2h3,hypothesis,
member(pair(ya,z),r),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2h3) ).
cnf(diamond_trancl_2h1,hypothesis,
diamond(r),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2h1) ).
cnf(diamond_trancl_2c1,negated_conjecture,
member(pair(y,yp),trancl(r)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2c1) ).
cnf(diamond_strip_lemmaD1,axiom,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_strip_lemmaD1) ).
cnf(r_into_trancl,axiom,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r_into_trancl) ).
cnf(transD,axiom,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transD) ).
cnf(diamond_trancl_2h5,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(X1,sk1(X1)),trancl(r)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2h5) ).
cnf(diamond_trancl_2c2,negated_conjecture,
( ~ member(pair(yp,X1),trancl(r))
| ~ member(pair(z,X1),trancl(r)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diamond_trancl_2c2) ).
cnf(trans_trancl,axiom,
trans(trancl(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trans_trancl) ).
cnf(c_0_11,plain,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD2]) ).
cnf(c_0_12,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(ya,sk1(X1)),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2h4]) ).
cnf(c_0_13,plain,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1) ),
c_0_11 ).
cnf(c_0_14,hypothesis,
member(pair(ya,z),r),
diamond_trancl_2h3 ).
cnf(c_0_15,hypothesis,
diamond(r),
diamond_trancl_2h1 ).
cnf(c_0_16,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(ya,sk1(X1)),trancl(r)) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
member(pair(y,yp),trancl(r)),
diamond_trancl_2c1 ).
cnf(c_0_18,plain,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1)) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD1]) ).
cnf(c_0_19,plain,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
inference(fof_simplification,[status(thm)],[r_into_trancl]) ).
cnf(c_0_20,hypothesis,
( ~ member(pair(ya,X1),trancl(r))
| member(pair(X1,diamond_strip_lemmaD_sk1(ya,X1,z,r)),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
member(pair(ya,sk1(yp)),trancl(r)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ member(pair(X2,X4),X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ diamond(X1)
| member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1)) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
inference(fof_simplification,[status(thm)],[transD]) ).
cnf(c_0_24,plain,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
member(pair(sk1(yp),diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),r),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(X1,sk1(X1)),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2h5]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(pair(yp,X1),trancl(r))
| ~ member(pair(z,X1),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_trancl_2c2]) ).
cnf(c_0_28,hypothesis,
( ~ member(pair(ya,X1),trancl(r))
| member(pair(z,diamond_strip_lemmaD_sk1(ya,X1,z,r)),trancl(r)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_15])]) ).
cnf(c_0_29,plain,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
member(pair(sk1(yp),diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,axiom,
trans(trancl(X1)),
trans_trancl ).
cnf(c_0_32,hypothesis,
( ~ member(pair(y,X1),trancl(r))
| member(pair(X1,sk1(X1)),trancl(r)) ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
( ~ member(pair(yp,X1),trancl(r))
| ~ member(pair(z,X1),trancl(r)) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
member(pair(z,diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(pair(X1,sk1(yp)),trancl(r))
| member(pair(X1,diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
member(pair(yp,sk1(yp)),trancl(r)),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_37,negated_conjecture,
~ member(pair(yp,diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL100-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n004.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 14:10:51 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.64/0.51 % Version: 3.5.1
% 0.64/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.64/0.51 % Starting sh5l with 300s (1) cores
% 0.64/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3337365 completed with status 0
% 0.64/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.64/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.51 % No SInE strategy applied
% 0.64/0.51 % Search class: FHHSF-FFSS32-SFFFFFNN
% 0.64/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.64/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.64/0.51 % new_bool_1 with pid 3337379 completed with status 0
% 0.64/0.51 % Result found by new_bool_1
% 0.64/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.64/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.51 % No SInE strategy applied
% 0.64/0.51 % Search class: FHHSF-FFSS32-SFFFFFNN
% 0.64/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.64/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.64/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.64/0.51 % Preprocessing time : 0.001 s
% 0.64/0.51 % Presaturation interreduction done
% 0.64/0.51
% 0.64/0.51 % Proof found!
% 0.64/0.51 % SZS status Unsatisfiable
% 0.64/0.51 % SZS output start CNFRefutation
% See solution above
% 0.64/0.51 % Parsed axioms : 18
% 0.64/0.51 % Removed by relevancy pruning/SinE : 0
% 0.64/0.51 % Initial clauses : 18
% 0.64/0.51 % Removed in clause preprocessing : 1
% 0.64/0.51 % Initial clauses in saturation : 17
% 0.64/0.51 % Processed clauses : 647
% 0.64/0.51 % ...of these trivial : 8
% 0.64/0.51 % ...subsumed : 0
% 0.64/0.51 % ...remaining for further processing : 639
% 0.64/0.51 % Other redundant clauses eliminated : 0
% 0.64/0.51 % Clauses deleted for lack of memory : 0
% 0.64/0.51 % Backward-subsumed : 0
% 0.64/0.51 % Backward-rewritten : 0
% 0.64/0.51 % Generated clauses : 1718
% 0.64/0.51 % ...of the previous two non-redundant : 1603
% 0.64/0.51 % ...aggressively subsumed : 0
% 0.64/0.51 % Contextual simplify-reflections : 0
% 0.64/0.51 % Paramodulations : 1716
% 0.64/0.51 % Factorizations : 0
% 0.64/0.51 % NegExts : 0
% 0.64/0.51 % Equation resolutions : 2
% 0.64/0.51 % Disequality decompositions : 0
% 0.64/0.51 % Total rewrite steps : 489
% 0.64/0.51 % ...of those cached : 381
% 0.64/0.51 % Propositional unsat checks : 0
% 0.64/0.51 % Propositional check models : 0
% 0.64/0.51 % Propositional check unsatisfiable : 0
% 0.64/0.51 % Propositional clauses : 0
% 0.64/0.51 % Propositional clauses after purity: 0
% 0.64/0.51 % Propositional unsat core size : 0
% 0.64/0.51 % Propositional preprocessing time : 0.000
% 0.64/0.51 % Propositional encoding time : 0.000
% 0.64/0.51 % Propositional solver time : 0.000
% 0.64/0.51 % Success case prop preproc time : 0.000
% 0.64/0.51 % Success case prop encoding time : 0.000
% 0.64/0.51 % Success case prop solver time : 0.000
% 0.64/0.51 % Current number of processed clauses : 622
% 0.64/0.51 % Positive orientable unit clauses : 368
% 0.64/0.51 % Positive unorientable unit clauses: 0
% 0.64/0.51 % Negative unit clauses : 12
% 0.64/0.51 % Non-unit-clauses : 242
% 0.64/0.51 % Current number of unprocessed clauses: 990
% 0.64/0.51 % ...number of literals in the above : 2529
% 0.64/0.51 % Current number of archived formulas : 0
% 0.64/0.51 % Current number of archived clauses : 17
% 0.64/0.51 % Clause-clause subsumption calls (NU) : 6529
% 0.64/0.51 % Rec. Clause-clause subsumption calls : 6382
% 0.64/0.51 % Non-unit clause-clause subsumptions : 0
% 0.64/0.51 % Unit Clause-clause subsumption calls : 258
% 0.64/0.51 % Rewrite failures with RHS unbound : 0
% 0.64/0.51 % BW rewrite match attempts : 5960
% 0.64/0.51 % BW rewrite match successes : 0
% 0.64/0.51 % Condensation attempts : 0
% 0.64/0.51 % Condensation successes : 0
% 0.64/0.51 % Termbank termtop insertions : 66846
% 0.64/0.51 % Search garbage collected termcells : 48
% 0.64/0.51
% 0.64/0.51 % -------------------------------------------------
% 0.64/0.51 % User time : 0.050 s
% 0.64/0.51 % System time : 0.012 s
% 0.64/0.51 % Total time : 0.062 s
% 0.64/0.51 % Maximum resident set size: 3644 pages
% 0.64/0.51
% 0.64/0.51 % -------------------------------------------------
% 0.64/0.51 % User time : 0.286 s
% 0.64/0.51 % System time : 0.033 s
% 0.64/0.51 % Total time : 0.320 s
% 0.64/0.51 % Maximum resident set size: 4864 pages
% 0.64/0.51 % E exiting
%------------------------------------------------------------------------------