%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL089-2 : 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 : n026.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:34 PM UTC 2026
% Result : Unsatisfiable 31.64s 5.09s
% Output : CNFRefutation 31.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 14 unt; 0 nHn; 33 RR)
% Number of literals : 75 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(reduction_rls_4,axiom,
( ~ member(pair(comb_app(X3,X2),X4),rtrancl(contract))
| ~ member(X3,comb)
| ~ member(pair(X1,X2),contract)
| member(pair(comb_app(X3,X1),X4),rtrancl(contract)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_rls_4) ).
cnf(reduction_refl,axiom,
( ~ member(X1,comb)
| member(pair(X1,X1),rtrancl(contract)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_refl) ).
cnf(ap_E1,axiom,
( ~ member(comb_app(X1,X2),comb)
| member(X1,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_E1) ).
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(trans_rtrancl,axiom,
trans(rtrancl(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trans_rtrancl) ).
cnf(ap_reduce2_2c1,negated_conjecture,
~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2c1) ).
cnf(ap_reduce2_2h5,hypothesis,
member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h5) ).
cnf(contract_combD2,axiom,
( ~ member(pair(X1,X2),contract)
| member(X2,comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contract_combD2) ).
cnf(ap_reduce2_2h4,hypothesis,
member(pair(y,z),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h4) ).
cnf(comb_intros3,axiom,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',comb_intros3) ).
cnf(ap_reduce2_2h1,hypothesis,
member(r,comb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce2_2h1) ).
cnf(c_0_11,plain,
( ~ member(pair(comb_app(X3,X2),X4),rtrancl(contract))
| ~ member(X3,comb)
| ~ member(pair(X1,X2),contract)
| member(pair(comb_app(X3,X1),X4),rtrancl(contract)) ),
inference(fof_simplification,[status(thm)],[reduction_rls_4]) ).
cnf(c_0_12,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),rtrancl(contract)) ),
inference(fof_simplification,[status(thm)],[reduction_refl]) ).
cnf(c_0_13,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X1,comb) ),
inference(fof_simplification,[status(thm)],[ap_E1]) ).
cnf(c_0_14,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_15,plain,
( ~ member(pair(comb_app(X3,X2),X4),rtrancl(contract))
| ~ member(X3,comb)
| ~ member(pair(X1,X2),contract)
| member(pair(comb_app(X3,X1),X4),rtrancl(contract)) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ member(X1,comb)
| member(pair(X1,X1),rtrancl(contract)) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ member(comb_app(X1,X2),comb)
| member(X1,comb) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ member(pair(X3,X4),X1)
| ~ member(pair(X2,X3),X1)
| ~ trans(X1)
| member(pair(X2,X4),X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ member(comb_app(X1,X3),comb)
| ~ member(pair(X2,X3),contract)
| member(pair(comb_app(X1,X2),comb_app(X1,X3)),rtrancl(contract)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,axiom,
trans(rtrancl(X1)),
trans_rtrancl ).
cnf(c_0_21,negated_conjecture,
~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
inference(fof_simplification,[status(thm)],[ap_reduce2_2c1]) ).
cnf(c_0_22,plain,
( ~ member(comb_app(X2,X3),comb)
| ~ member(pair(X4,X3),contract)
| ~ member(pair(X1,comb_app(X2,X4)),rtrancl(contract))
| member(pair(X1,comb_app(X2,X3)),rtrancl(contract)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,hypothesis,
member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
ap_reduce2_2h5 ).
cnf(c_0_24,plain,
( ~ member(pair(X1,X2),contract)
| member(X2,comb) ),
inference(fof_simplification,[status(thm)],[contract_combD2]) ).
cnf(c_0_25,negated_conjecture,
~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
c_0_21 ).
cnf(c_0_26,hypothesis,
( ~ member(comb_app(r,X1),comb)
| ~ member(pair(y,X1),contract)
| member(pair(comb_app(r,p),comb_app(r,X1)),rtrancl(contract)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
member(pair(y,z),contract),
ap_reduce2_2h4 ).
cnf(c_0_28,plain,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(comb_app(X1,X2),comb) ),
inference(fof_simplification,[status(thm)],[comb_intros3]) ).
cnf(c_0_29,plain,
( ~ member(pair(X1,X2),contract)
| member(X2,comb) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
~ member(comb_app(r,z),comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( ~ member(X2,comb)
| ~ member(X1,comb)
| member(comb_app(X1,X2),comb) ),
c_0_28 ).
cnf(c_0_32,hypothesis,
member(z,comb),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_33,hypothesis,
member(r,comb),
ap_reduce2_2h1 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL089-2 : 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.39 % Computer : n026.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 21 14:13:08 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/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
% 31.64/5.09 % Version: 3.5.1
% 31.64/5.09 % Preprocessing class: FSLSSMSMSSSNFFN.
% 31.64/5.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.64/5.09 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 31.64/5.09 % Starting new_bool_3 with 300s (1) cores
% 31.64/5.09 % Starting new_bool_1 with 300s (1) cores
% 31.64/5.09 % Starting sh5l with 300s (1) cores
% 31.64/5.09 % sh5l with pid 2478809 completed with status 0
% 31.64/5.09 % Result found by sh5l
% 31.64/5.09 % Preprocessing class: FSLSSMSMSSSNFFN.
% 31.64/5.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.64/5.09 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 31.64/5.09 % Starting new_bool_3 with 300s (1) cores
% 31.64/5.09 % Starting new_bool_1 with 300s (1) cores
% 31.64/5.09 % Starting sh5l with 300s (1) cores
% 31.64/5.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 31.64/5.09 % SinE strategy is gf500_gu_R04_F100_L20000
% 31.64/5.09 % Search class: FGUSF-FFMM32-MFFFFFNN
% 31.64/5.09 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.64/5.09 % Starting SubtermCWHack with 31s (1) cores
% 31.64/5.09 % SubtermCWHack with pid 2478817 completed with status 0
% 31.64/5.09 % Result found by SubtermCWHack
% 31.64/5.09 % Preprocessing class: FSLSSMSMSSSNFFN.
% 31.64/5.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.64/5.09 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 31.64/5.09 % Starting new_bool_3 with 300s (1) cores
% 31.64/5.09 % Starting new_bool_1 with 300s (1) cores
% 31.64/5.09 % Starting sh5l with 300s (1) cores
% 31.64/5.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 31.64/5.09 % SinE strategy is gf500_gu_R04_F100_L20000
% 31.64/5.09 % Search class: FGUSF-FFMM32-MFFFFFNN
% 31.64/5.09 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.64/5.09 % Starting SubtermCWHack with 31s (1) cores
% 31.64/5.09 % Preprocessing time : 0.002 s
% 31.64/5.09
% 31.64/5.09 % Proof found!
% 31.64/5.09 % SZS status Unsatisfiable
% 31.64/5.09 % SZS output start CNFRefutation
% See solution above
% 31.64/5.09 % Parsed axioms : 186
% 31.64/5.09 % Removed by relevancy pruning/SinE : 138
% 31.64/5.09 % Initial clauses : 48
% 31.64/5.09 % Removed in clause preprocessing : 1
% 31.64/5.09 % Initial clauses in saturation : 47
% 31.64/5.09 % Processed clauses : 6432
% 31.64/5.09 % ...of these trivial : 0
% 31.64/5.09 % ...subsumed : 3249
% 31.64/5.09 % ...remaining for further processing : 3183
% 31.64/5.09 % Other redundant clauses eliminated : 136
% 31.64/5.09 % Clauses deleted for lack of memory : 0
% 31.64/5.09 % Backward-subsumed : 33
% 31.64/5.09 % Backward-rewritten : 0
% 31.64/5.09 % Generated clauses : 91029
% 31.64/5.09 % ...of the previous two non-redundant : 90530
% 31.64/5.09 % ...aggressively subsumed : 0
% 31.64/5.09 % Contextual simplify-reflections : 216
% 31.64/5.09 % Paramodulations : 90889
% 31.64/5.09 % Factorizations : 0
% 31.64/5.09 % NegExts : 0
% 31.64/5.09 % Equation resolutions : 140
% 31.64/5.09 % Disequality decompositions : 0
% 31.64/5.09 % Total rewrite steps : 1110
% 31.64/5.09 % ...of those cached : 1101
% 31.64/5.09 % Propositional unsat checks : 0
% 31.64/5.09 % Propositional check models : 0
% 31.64/5.09 % Propositional check unsatisfiable : 0
% 31.64/5.09 % Propositional clauses : 0
% 31.64/5.09 % Propositional clauses after purity: 0
% 31.64/5.09 % Propositional unsat core size : 0
% 31.64/5.09 % Propositional preprocessing time : 0.000
% 31.64/5.09 % Propositional encoding time : 0.000
% 31.64/5.09 % Propositional solver time : 0.000
% 31.64/5.09 % Success case prop preproc time : 0.000
% 31.64/5.09 % Success case prop encoding time : 0.000
% 31.64/5.09 % Success case prop solver time : 0.000
% 31.64/5.09 % Current number of processed clauses : 3150
% 31.64/5.09 % Positive orientable unit clauses : 9
% 31.64/5.09 % Positive unorientable unit clauses: 0
% 31.64/5.09 % Negative unit clauses : 47
% 31.64/5.09 % Non-unit-clauses : 3094
% 31.64/5.09 % Current number of unprocessed clauses: 84095
% 31.64/5.09 % ...number of literals in the above : 430295
% 31.64/5.09 % Current number of archived formulas : 0
% 31.64/5.09 % Current number of archived clauses : 33
% 31.64/5.09 % Clause-clause subsumption calls (NU) : 3538301
% 31.64/5.09 % Rec. Clause-clause subsumption calls : 626596
% 31.64/5.09 % Non-unit clause-clause subsumptions : 2793
% 31.64/5.09 % Unit Clause-clause subsumption calls : 2994
% 31.64/5.09 % Rewrite failures with RHS unbound : 0
% 31.64/5.09 % BW rewrite match attempts : 0
% 31.64/5.09 % BW rewrite match successes : 0
% 31.64/5.09 % Condensation attempts : 0
% 31.64/5.09 % Condensation successes : 0
% 31.64/5.09 % Termbank termtop insertions : 1535713
% 31.64/5.09 % Search garbage collected termcells : 684
% 31.64/5.09
% 31.64/5.09 % -------------------------------------------------
% 31.64/5.09 % User time : 4.376 s
% 31.64/5.09 % System time : 0.103 s
% 31.64/5.09 % Total time : 4.479 s
% 31.64/5.09 % Maximum resident set size: 3788 pages
% 31.64/5.09
% 31.64/5.09 % -------------------------------------------------
% 31.64/5.09 % User time : 4.381 s
% 31.64/5.09 % System time : 0.109 s
% 31.64/5.09 % Total time : 4.489 s
% 31.64/5.09 % Maximum resident set size: 4864 pages
% 31.64/5.09 % E exiting
%------------------------------------------------------------------------------