%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL090-3 : 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 : n016.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 0.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 46 ( 16 unt; 14 nHn; 46 RR)
% Number of literals : 100 ( 27 equ; 32 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ap_contractE1,axiom,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE1) ).
cnf(ap_contractE13,axiom,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE13) ).
cnf(i_contract_E,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i_contract_E) ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_contractE) ).
cnf(ap_contractE10,axiom,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE10) ).
cnf(s_contractE,axiom,
~ member(pair(combS,X1),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_contractE) ).
cnf(ap_contractE4,axiom,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE4) ).
cnf(s_app,axiom,
combS != comb_app(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_app) ).
cnf(ap_contractE9,axiom,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE9) ).
cnf(app_app1,axiom,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',app_app1) ).
cnf(k_s,axiom,
combK != combS,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_s) ).
cnf(c_0_11,plain,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE1]) ).
cnf(c_0_12,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
inference(fof_simplification,[status(thm)],[ap_contractE13]) ).
cnf(c_0_13,plain,
( ~ member(pair(comb_app(X1,X2),X3),contract)
| ap_contractE_c4(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c1(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
member(pair(comb_app(comb_app(combS,combK),combK),r),contract),
i_contract_E ).
cnf(c_0_15,plain,
~ member(pair(combK,X1),contract),
inference(fof_simplification,[status(thm)],[k_contractE]) ).
cnf(c_0_16,plain,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
inference(fof_simplification,[status(thm)],[ap_contractE10]) ).
cnf(c_0_17,plain,
( ~ ap_contractE_c4(X1,X2,X3)
| member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c3(comb_app(combS,combK),combK,r)
| ap_contractE_c4(comb_app(combS,combK),combK,r) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ member(pair(combK,X1),contract),
c_0_15 ).
cnf(c_0_20,plain,
( ~ ap_contractE_c3(X1,X2,X3)
| member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c3(comb_app(combS,combK),combK,r) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( member(pair(comb_app(combS,combK),ap_contractE_sk2q(comb_app(combS,combK),combK,r)),contract)
| ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c2(comb_app(combS,combK),combK,r) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c1(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c2(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c3(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c4(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_24,plain,
~ member(pair(combS,X1),contract),
inference(fof_simplification,[status(thm)],[s_contractE]) ).
cnf(c_0_25,plain,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
inference(fof_simplification,[status(thm)],[ap_contractE4]) ).
cnf(c_0_26,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c1(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c2(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c3(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_19]) ).
cnf(c_0_27,plain,
~ member(pair(combS,X1),contract),
c_0_24 ).
cnf(c_0_28,plain,
combS != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[s_app]) ).
cnf(c_0_29,plain,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[ap_contractE9]) ).
cnf(c_0_30,plain,
( ~ ap_contractE_c1(X1,X2,X3)
| X1 = comb_app(combK,X3) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c1(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r))
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c2(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
combS != comb_app(X1,X2),
c_0_28 ).
cnf(c_0_33,plain,
( ~ ap_contractE_c2(X1,X2,X3)
| X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3)) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c2(comb_app(combS,combK),combK,r)
| ap_contractE_c2(combS,combK,ap_contractE_sk2q(comb_app(combS,combK),combK,r)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ap_contractE_c1(comb_app(combS,combK),combK,r)
| ap_contractE_c2(comb_app(combS,combK),combK,r) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]) ).
cnf(c_0_36,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[app_app1]) ).
cnf(c_0_37,negated_conjecture,
( ap_contractE_c2(comb_app(combS,combK),combK,r)
| comb_app(combS,combK) = comb_app(combK,r) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_38,plain,
( comb_app(X1,X2) != comb_app(X3,X4)
| X1 = X3 ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
( comb_app(combS,combK) = comb_app(combK,r)
| comb_app(comb_app(combS,ap_contractE_sk1p(comb_app(combS,combK),combK,r)),ap_contractE_sk1q(comb_app(combS,combK),combK,r)) = comb_app(combS,combK) ),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( comb_app(combS,combK) != comb_app(X1,X2)
| comb_app(combS,combK) = comb_app(combK,r)
| comb_app(combS,ap_contractE_sk1p(comb_app(combS,combK),combK,r)) = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
comb_app(combS,combK) = comb_app(combK,r),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_32]) ).
cnf(c_0_42,plain,
combK != combS,
inference(fof_simplification,[status(thm)],[k_s]) ).
cnf(c_0_43,negated_conjecture,
( comb_app(combK,r) != comb_app(X1,X2)
| combS = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_44,plain,
combK != combS,
c_0_42 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COL090-3 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.42 % Computer : n016.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 14:14:54 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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
% 0.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2630280 completed with status 0
% 0.26/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFMF32-MFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.54 % new_bool_3 with pid 2630289 completed with status 0
% 0.26/0.54 % Result found by new_bool_3
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFMF32-MFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Preprocessing time : 0.001 s
% 0.26/0.54 % Presaturation interreduction done
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Unsatisfiable
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 24
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 24
% 0.26/0.54 % Removed in clause preprocessing : 1
% 0.26/0.54 % Initial clauses in saturation : 23
% 0.26/0.54 % Processed clauses : 124
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 32
% 0.26/0.54 % ...remaining for further processing : 92
% 0.26/0.54 % Other redundant clauses eliminated : 0
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 15
% 0.26/0.54 % Backward-rewritten : 16
% 0.26/0.54 % Generated clauses : 142
% 0.26/0.54 % ...of the previous two non-redundant : 135
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 2
% 0.26/0.54 % Paramodulations : 137
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 5
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 49
% 0.26/0.54 % ...of those cached : 47
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 38
% 0.26/0.54 % Positive orientable unit clauses : 4
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 5
% 0.26/0.54 % Non-unit-clauses : 29
% 0.26/0.54 % Current number of unprocessed clauses: 48
% 0.26/0.54 % ...number of literals in the above : 156
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 54
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 856
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 513
% 0.26/0.54 % Non-unit clause-clause subsumptions : 39
% 0.26/0.54 % Unit Clause-clause subsumption calls : 4
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 2
% 0.26/0.54 % BW rewrite match successes : 1
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 3553
% 0.26/0.54 % Search garbage collected termcells : 41
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.008 s
% 0.26/0.54 % System time : 0.005 s
% 0.26/0.54 % Total time : 0.013 s
% 0.26/0.54 % Maximum resident set size: 3648 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.034 s
% 0.26/0.54 % System time : 0.019 s
% 0.26/0.54 % Total time : 0.052 s
% 0.26/0.54 % Maximum resident set size: 4608 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------