%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL098-2 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:36 PM UTC 2026
% Result : Unsatisfiable 107.44s 21.22s
% Output : CNFRefutation 107.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 9 unt; 0 nHn; 34 RR)
% Number of literals : 79 ( 0 equ; 52 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 62 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(diamond_strip_lemmaD_2c2,negated_conjecture,
( ~ member(pair(z,X1),r)
| ~ member(pair(sk3,X1),trancl(r)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2c2) ).
cnf(diamond_strip_lemmaD_2h1,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X2,sk1(X1,X2,X3)),r) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2h1) ).
cnf(diamond_strip_lemmaD_2h4,hypothesis,
member(pair(y,z),r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2h4) ).
cnf(diamond_strip_lemmaD_2h6,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(y,sk2(X1)),r) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2h6) ).
cnf(transD,axiom,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transD) ).
cnf(r_into_trancl,axiom,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r_into_trancl) ).
cnf(trans_trancl,axiom,
trans(trancl(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',trans_trancl) ).
cnf(diamond_strip_lemmaD_2h2,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X3,sk1(X1,X2,X3)),r) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2h2) ).
cnf(diamond_strip_lemmaD_2c1,negated_conjecture,
member(pair(x,sk3),r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2c1) ).
cnf(diamond_strip_lemmaD_2h5,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(X1,sk2(X1)),trancl(r)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD_2h5) ).
cnf(c_0_10,negated_conjecture,
( ~ member(pair(z,X1),r)
| ~ member(pair(sk3,X1),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2c2]) ).
cnf(c_0_11,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X2,sk1(X1,X2,X3)),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h1]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(pair(z,X1),r)
| ~ member(pair(sk3,X1),trancl(r)) ),
c_0_10 ).
cnf(c_0_13,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X2,sk1(X1,X2,X3)),r) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
( ~ member(pair(X1,X2),r)
| ~ member(pair(X1,z),r)
| ~ member(pair(sk3,sk1(X1,z,X2)),trancl(r)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,hypothesis,
member(pair(y,z),r),
diamond_strip_lemmaD_2h4 ).
cnf(c_0_16,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(y,sk2(X1)),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h6]) ).
cnf(c_0_17,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_18,plain,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
inference(fof_simplification,[status(thm)],[r_into_trancl]) ).
cnf(c_0_19,hypothesis,
( ~ member(pair(y,X1),r)
| ~ member(pair(sk3,sk1(y,z,X1)),trancl(r)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(y,sk2(X1)),r) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
c_0_17 ).
cnf(c_0_22,plain,
( ~ member(pair(X1,X2),X3)
| member(pair(X1,X2),trancl(X3)) ),
c_0_18 ).
cnf(c_0_23,axiom,
trans(trancl(X1)),
trans_trancl ).
cnf(c_0_24,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X3,sk1(X1,X2,X3)),r) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h2]) ).
cnf(c_0_25,hypothesis,
( ~ member(pair(x,X1),r)
| ~ member(pair(sk3,sk1(y,z,sk2(X1))),trancl(r)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
member(pair(x,sk3),r),
diamond_strip_lemmaD_2c1 ).
cnf(c_0_27,plain,
( ~ member(pair(X4,X2),X3)
| ~ member(pair(X1,X4),trancl(X3))
| member(pair(X1,X2),trancl(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
( ~ member(pair(X1,X3),r)
| ~ member(pair(X1,X2),r)
| member(pair(X3,sk1(X1,X2,X3)),r) ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
~ member(pair(sk3,sk1(y,z,sk2(sk3))),trancl(r)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
( ~ member(pair(X2,X3),r)
| ~ member(pair(X2,X4),r)
| ~ member(pair(X1,X4),trancl(r))
| member(pair(X1,sk1(X2,X3,X4)),trancl(r)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(X1,sk2(X1)),trancl(r)) ),
inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD_2h5]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(pair(y,sk2(sk3)),r)
| ~ member(pair(sk3,sk2(sk3)),trancl(r)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15])]) ).
cnf(c_0_33,hypothesis,
( ~ member(pair(x,X1),r)
| member(pair(X1,sk2(X1)),trancl(r)) ),
c_0_31 ).
cnf(c_0_34,hypothesis,
~ member(pair(y,sk2(sk3)),r),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]) ).
cnf(c_0_35,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL098-2 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.38 % Computer : n007.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.39 % CPULimit : 300
% 0.13/5.39 % WCLimit : 300
% 0.13/5.39 % DateTime : Mon Sep 21 14:08:26 UTC 2026
% 0.13/5.39 % CPUTime :
% 0.13/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 107.44/21.22 % Version: 3.5.1
% 107.44/21.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 107.44/21.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 107.44/21.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 107.44/21.22 % Starting new_bool_3 with 300s (1) cores
% 107.44/21.22 % Starting new_bool_1 with 300s (1) cores
% 107.44/21.22 % Starting sh5l with 300s (1) cores
% 107.44/21.22 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1292512 completed with status 0
% 107.44/21.22 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 107.44/21.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 107.44/21.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 107.44/21.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 107.44/21.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 107.44/21.22 % No SInE strategy applied
% 107.44/21.22 % Search class: FGHSM-FFLS31-SFFFFFNN
% 107.44/21.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 107.44/21.22 % Starting SubtermCWHack with 136s (1) cores
% 107.44/21.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 107.44/21.22 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 107.44/21.22 % Starting new_bool_3 with 136s (1) cores
% 107.44/21.22 % Starting new_bool_1 with 136s (1) cores
% 107.44/21.22 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 1292521 completed with status 0
% 107.44/21.22 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 107.44/21.22 % Preprocessing class: FSLSSMSMSSSNFFN.
% 107.44/21.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 107.44/21.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 107.44/21.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 107.44/21.22 % No SInE strategy applied
% 107.44/21.22 % Search class: FGHSM-FFLS31-SFFFFFNN
% 107.44/21.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 107.44/21.22 % Starting SubtermCWHack with 136s (1) cores
% 107.44/21.22 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 107.44/21.22 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 107.44/21.22 % Preprocessing time : 0.004 s
% 107.44/21.22
% 107.44/21.22 % Proof found!
% 107.44/21.22 % SZS status Unsatisfiable
% 107.44/21.22 % SZS output start CNFRefutation
% See solution above
% 107.44/21.22 % Parsed axioms : 159
% 107.44/21.22 % Removed by relevancy pruning/SinE : 0
% 107.44/21.22 % Initial clauses : 159
% 107.44/21.22 % Removed in clause preprocessing : 4
% 107.44/21.22 % Initial clauses in saturation : 155
% 107.44/21.22 % Processed clauses : 4315
% 107.44/21.22 % ...of these trivial : 53
% 107.44/21.22 % ...subsumed : 597
% 107.44/21.22 % ...remaining for further processing : 3665
% 107.44/21.22 % Other redundant clauses eliminated : 4
% 107.44/21.22 % Clauses deleted for lack of memory : 0
% 107.44/21.22 % Backward-subsumed : 29
% 107.44/21.22 % Backward-rewritten : 45
% 107.44/21.22 % Generated clauses : 368349
% 107.44/21.22 % ...of the previous two non-redundant : 364576
% 107.44/21.22 % ...aggressively subsumed : 0
% 107.44/21.22 % Contextual simplify-reflections : 6
% 107.44/21.22 % Paramodulations : 368286
% 107.44/21.22 % Factorizations : 2
% 107.44/21.22 % NegExts : 0
% 107.44/21.22 % Equation resolutions : 61
% 107.44/21.22 % Disequality decompositions : 0
% 107.44/21.22 % Total rewrite steps : 4634
% 107.44/21.22 % ...of those cached : 3747
% 107.44/21.22 % Propositional unsat checks : 0
% 107.44/21.22 % Propositional check models : 0
% 107.44/21.22 % Propositional check unsatisfiable : 0
% 107.44/21.22 % Propositional clauses : 0
% 107.44/21.22 % Propositional clauses after purity: 0
% 107.44/21.22 % Propositional unsat core size : 0
% 107.44/21.22 % Propositional preprocessing time : 0.000
% 107.44/21.22 % Propositional encoding time : 0.000
% 107.44/21.22 % Propositional solver time : 0.000
% 107.44/21.22 % Success case prop preproc time : 0.000
% 107.44/21.22 % Success case prop encoding time : 0.000
% 107.44/21.22 % Success case prop solver time : 0.000
% 107.44/21.22 % Current number of processed clauses : 3587
% 107.44/21.22 % Positive orientable unit clauses : 817
% 107.44/21.22 % Positive unorientable unit clauses: 0
% 107.44/21.22 % Negative unit clauses : 181
% 107.44/21.22 % Non-unit-clauses : 2589
% 107.44/21.22 % Current number of unprocessed clauses: 359386
% 107.44/21.22 % ...number of literals in the above : 964819
% 107.44/21.22 % Current number of archived formulas : 0
% 107.44/21.22 % Current number of archived clauses : 74
% 107.44/21.22 % Clause-clause subsumption calls (NU) : 1187959
% 107.44/21.22 % Rec. Clause-clause subsumption calls : 633490
% 107.44/21.22 % Non-unit clause-clause subsumptions : 399
% 107.44/21.22 % Unit Clause-clause subsumption calls : 665888
% 107.44/21.22 % Rewrite failures with RHS unbound : 0
% 107.44/21.22 % BW rewrite match attempts : 14037
% 107.44/21.22 % BW rewrite match successes : 36
% 107.44/21.22 % Condensation attempts : 0
% 107.44/21.22 % Condensation successes : 0
% 107.44/21.22 % Termbank termtop insertions : 13331961
% 107.44/21.22 % Search garbage collected termcells : 324
% 107.44/21.22
% 107.44/21.22 % -------------------------------------------------
% 107.44/21.22 % User time : 14.700 s
% 107.44/21.22 % System time : 0.495 s
% 107.44/21.22 % Total time : 15.195 s
% 107.44/21.22 % Maximum resident set size: 3712 pages
% 107.44/21.22
% 107.44/21.22 % -------------------------------------------------
% 107.44/21.22 % User time : 73.249 s
% 107.44/21.22 % System time : 2.750 s
% 107.44/21.22 % Total time : 75.999 s
% 107.44/21.22 % Maximum resident set size: 4864 pages
% 107.44/21.22 % E exiting
%------------------------------------------------------------------------------