%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL062-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 : n008.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:58 PM UTC 2026
% Result : Unsatisfiable 0.51s 0.56s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 14 equ; 10 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_c_combinator,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(apply(f(X1),h(X1)),g(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_combinator) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).
cnf(c_0_3,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(apply(f(X1),h(X1)),g(X1)),
inference(fof_simplification,[status(thm)],[prove_c_combinator]) ).
cnf(c_0_4,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(apply(f(X1),h(X1)),g(X1)),
c_0_3 ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,negated_conjecture,
apply(apply(apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),g(apply(apply(b,X1),X2))),h(apply(apply(b,X1),X2))) != apply(apply(f(apply(apply(b,X1),X2)),h(apply(apply(b,X1),X2))),g(apply(apply(b,X1),X2))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
t_definition ).
cnf(c_0_8,negated_conjecture,
apply(apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),X1))),X2),g(apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,apply(t,X2)),X1))) != apply(apply(f(apply(apply(b,apply(t,X2)),X1)),h(apply(apply(b,apply(t,X2)),X1))),g(apply(apply(b,apply(t,X2)),X1))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),X3),g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))) != apply(apply(f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),apply(X2,g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))) != apply(apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))) != apply(apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(apply(X1,apply(X2,g(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))),f(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))) != apply(apply(f(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,negated_conjecture,
apply(apply(X1,g(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),apply(f(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_13,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL062-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.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 : Mon Sep 21 14:08:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.51/0.56 % Version: 3.5.1
% 0.51/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.51/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.51/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.51/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.51/0.56 % Starting sh5l with 300s (1) cores
% 0.51/0.56 % new_bool_3 with pid 1180644 completed with status 9
% 0.51/0.56 % new_bool_1 with pid 1180645 completed with status 9
% 0.51/0.56 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1180642 completed with status 0
% 0.51/0.56 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.51/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.51/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.51/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.56 % No SInE strategy applied
% 0.51/0.56 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.51/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.51/0.56 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.51/0.56 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.51/0.56 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.51/0.56 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1180653 completed with status 0
% 0.51/0.56 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.51/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.51/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.51/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.56 % No SInE strategy applied
% 0.51/0.56 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.51/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.51/0.56 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.51/0.56 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.51/0.56 % Preprocessing time : 0.001 s
% 0.51/0.56 % Presaturation interreduction done
% 0.51/0.56
% 0.51/0.56 % Proof found!
% 0.51/0.56 % SZS status Unsatisfiable
% 0.51/0.56 % SZS output start CNFRefutation
% See solution above
% 0.51/0.56 % Parsed axioms : 3
% 0.51/0.56 % Removed by relevancy pruning/SinE : 0
% 0.51/0.56 % Initial clauses : 3
% 0.51/0.56 % Removed in clause preprocessing : 0
% 0.51/0.56 % Initial clauses in saturation : 3
% 0.51/0.56 % Processed clauses : 815
% 0.51/0.56 % ...of these trivial : 0
% 0.51/0.56 % ...subsumed : 158
% 0.51/0.56 % ...remaining for further processing : 657
% 0.51/0.56 % Other redundant clauses eliminated : 0
% 0.51/0.56 % Clauses deleted for lack of memory : 0
% 0.51/0.56 % Backward-subsumed : 0
% 0.51/0.56 % Backward-rewritten : 0
% 0.51/0.56 % Generated clauses : 2030
% 0.51/0.56 % ...of the previous two non-redundant : 2028
% 0.51/0.56 % ...aggressively subsumed : 0
% 0.51/0.56 % Contextual simplify-reflections : 0
% 0.51/0.56 % Paramodulations : 2030
% 0.51/0.56 % Factorizations : 0
% 0.51/0.56 % NegExts : 0
% 0.51/0.56 % Equation resolutions : 0
% 0.51/0.56 % Disequality decompositions : 0
% 0.51/0.56 % Total rewrite steps : 0
% 0.51/0.56 % ...of those cached : 0
% 0.51/0.56 % Propositional unsat checks : 0
% 0.51/0.56 % Propositional check models : 0
% 0.51/0.56 % Propositional check unsatisfiable : 0
% 0.51/0.56 % Propositional clauses : 0
% 0.51/0.56 % Propositional clauses after purity: 0
% 0.51/0.56 % Propositional unsat core size : 0
% 0.51/0.56 % Propositional preprocessing time : 0.000
% 0.51/0.56 % Propositional encoding time : 0.000
% 0.51/0.56 % Propositional solver time : 0.000
% 0.51/0.56 % Success case prop preproc time : 0.000
% 0.51/0.56 % Success case prop encoding time : 0.000
% 0.51/0.56 % Success case prop solver time : 0.000
% 0.51/0.56 % Current number of processed clauses : 654
% 0.51/0.56 % Positive orientable unit clauses : 2
% 0.51/0.56 % Positive unorientable unit clauses: 0
% 0.51/0.56 % Negative unit clauses : 652
% 0.51/0.56 % Non-unit-clauses : 0
% 0.51/0.56 % Current number of unprocessed clauses: 1217
% 0.51/0.56 % ...number of literals in the above : 1217
% 0.51/0.56 % Current number of archived formulas : 0
% 0.51/0.56 % Current number of archived clauses : 3
% 0.51/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.51/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.51/0.56 % Non-unit clause-clause subsumptions : 0
% 0.51/0.56 % Unit Clause-clause subsumption calls : 58730
% 0.51/0.56 % Rewrite failures with RHS unbound : 0
% 0.51/0.56 % BW rewrite match attempts : 2
% 0.51/0.56 % BW rewrite match successes : 0
% 0.51/0.56 % Condensation attempts : 0
% 0.51/0.56 % Condensation successes : 0
% 0.51/0.56 % Termbank termtop insertions : 252562
% 0.51/0.56 % Search garbage collected termcells : 2
% 0.51/0.56
% 0.51/0.56 % -------------------------------------------------
% 0.51/0.56 % User time : 0.096 s
% 0.51/0.56 % System time : 0.023 s
% 0.51/0.56 % Total time : 0.119 s
% 0.51/0.56 % Maximum resident set size: 3608 pages
% 0.51/0.56
% 0.51/0.56 % -------------------------------------------------
% 0.51/0.56 % User time : 0.503 s
% 0.51/0.56 % System time : 0.138 s
% 0.51/0.56 % Total time : 0.641 s
% 0.51/0.56 % Maximum resident set size: 4864 pages
% 0.51/0.56 % E exiting
%------------------------------------------------------------------------------