%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL065-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:10:00 PM UTC 2026
% Result : Unsatisfiable 13.56s 3.21s
% Output : CNFRefutation 13.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 13 RR)
% Number of literals : 17 ( 16 equ; 12 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_g_combinator,negated_conjecture,
apply(apply(apply(apply(X1,f(X1)),g(X1)),h(X1)),i(X1)) != apply(apply(f(X1),i(X1)),apply(g(X1),h(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_g_combinator) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_definition) ).
cnf(c_0_3,negated_conjecture,
apply(apply(apply(apply(X1,f(X1)),g(X1)),h(X1)),i(X1)) != apply(apply(f(X1),i(X1)),apply(g(X1),h(X1))),
inference(fof_simplification,[status(thm)],[prove_g_combinator]) ).
cnf(c_0_4,negated_conjecture,
apply(apply(apply(apply(X1,f(X1)),g(X1)),h(X1)),i(X1)) != apply(apply(f(X1),i(X1)),apply(g(X1),h(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(apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),g(apply(apply(b,X1),X2))),h(apply(apply(b,X1),X2))),i(apply(apply(b,X1),X2))) != apply(apply(f(apply(apply(b,X1),X2)),i(apply(apply(b,X1),X2))),apply(g(apply(apply(b,X1),X2)),h(apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
apply(apply(apply(X1,f(apply(apply(b,b),X1))),apply(g(apply(apply(b,b),X1)),h(apply(apply(b,b),X1)))),i(apply(apply(b,b),X1))) != apply(apply(f(apply(apply(b,b),X1)),i(apply(apply(b,b),X1))),apply(g(apply(apply(b,b),X1)),h(apply(apply(b,b),X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
apply(apply(apply(X1,apply(X2,f(apply(apply(b,b),apply(apply(b,X1),X2))))),apply(g(apply(apply(b,b),apply(apply(b,X1),X2))),h(apply(apply(b,b),apply(apply(b,X1),X2))))),i(apply(apply(b,b),apply(apply(b,X1),X2)))) != apply(apply(f(apply(apply(b,b),apply(apply(b,X1),X2))),i(apply(apply(b,b),apply(apply(b,X1),X2)))),apply(g(apply(apply(b,b),apply(apply(b,X1),X2))),h(apply(apply(b,b),apply(apply(b,X1),X2))))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
t_definition ).
cnf(c_0_10,negated_conjecture,
apply(apply(apply(apply(X1,f(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))),X2),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),X3),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),i(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),i(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(apply(X1,f(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),apply(X2,apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,negated_conjecture,
apply(apply(apply(X1,apply(g(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))))),f(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))),i(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))))),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
apply(apply(apply(X1,apply(X2,apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))))),f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))))),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_15,negated_conjecture,
apply(apply(X1,apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))),apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL065-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:08:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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
% 13.56/3.21 % Version: 3.5.1
% 13.56/3.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.56/3.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.56/3.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.56/3.21 % Starting new_bool_3 with 300s (1) cores
% 13.56/3.21 % Starting new_bool_1 with 300s (1) cores
% 13.56/3.21 % Starting sh5l with 300s (1) cores
% 13.56/3.21 % new_bool_3 with pid 2112759 completed with status 9
% 13.56/3.21 % new_bool_1 with pid 2112760 completed with status 9
% 13.56/3.21 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2112758 completed with status 0
% 13.56/3.21 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 13.56/3.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.56/3.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.56/3.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.56/3.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.56/3.21 % No SInE strategy applied
% 13.56/3.21 % Search class: FUUPS-FFSF21-MFFFFFNN
% 13.56/3.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.56/3.21 % Starting SubtermCWHack with 136s (1) cores
% 13.56/3.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 13.56/3.21 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 13.56/3.21 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 13.56/3.21 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 13.56/3.21 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2112767 completed with status 0
% 13.56/3.21 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 13.56/3.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.56/3.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.56/3.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.56/3.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.56/3.21 % No SInE strategy applied
% 13.56/3.21 % Search class: FUUPS-FFSF21-MFFFFFNN
% 13.56/3.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.56/3.21 % Starting SubtermCWHack with 136s (1) cores
% 13.56/3.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 13.56/3.21 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 13.56/3.21 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 13.56/3.21 % Preprocessing time : 0.001 s
% 13.56/3.21 % Presaturation interreduction done
% 13.56/3.21
% 13.56/3.21 % Proof found!
% 13.56/3.21 % SZS status Unsatisfiable
% 13.56/3.21 % SZS output start CNFRefutation
% See solution above
% 13.56/3.21 % Parsed axioms : 3
% 13.56/3.21 % Removed by relevancy pruning/SinE : 0
% 13.56/3.21 % Initial clauses : 3
% 13.56/3.21 % Removed in clause preprocessing : 0
% 13.56/3.21 % Initial clauses in saturation : 3
% 13.56/3.21 % Processed clauses : 5317
% 13.56/3.21 % ...of these trivial : 0
% 13.56/3.21 % ...subsumed : 1161
% 13.56/3.21 % ...remaining for further processing : 4156
% 13.56/3.21 % Other redundant clauses eliminated : 0
% 13.56/3.21 % Clauses deleted for lack of memory : 0
% 13.56/3.21 % Backward-subsumed : 0
% 13.56/3.21 % Backward-rewritten : 0
% 13.56/3.21 % Generated clauses : 12704
% 13.56/3.21 % ...of the previous two non-redundant : 12702
% 13.56/3.21 % ...aggressively subsumed : 0
% 13.56/3.21 % Contextual simplify-reflections : 0
% 13.56/3.21 % Paramodulations : 12704
% 13.56/3.21 % Factorizations : 0
% 13.56/3.21 % NegExts : 0
% 13.56/3.21 % Equation resolutions : 0
% 13.56/3.21 % Disequality decompositions : 0
% 13.56/3.21 % Total rewrite steps : 0
% 13.56/3.21 % ...of those cached : 0
% 13.56/3.21 % Propositional unsat checks : 0
% 13.56/3.21 % Propositional check models : 0
% 13.56/3.21 % Propositional check unsatisfiable : 0
% 13.56/3.21 % Propositional clauses : 0
% 13.56/3.21 % Propositional clauses after purity: 0
% 13.56/3.21 % Propositional unsat core size : 0
% 13.56/3.21 % Propositional preprocessing time : 0.000
% 13.56/3.21 % Propositional encoding time : 0.000
% 13.56/3.21 % Propositional solver time : 0.000
% 13.56/3.21 % Success case prop preproc time : 0.000
% 13.56/3.21 % Success case prop encoding time : 0.000
% 13.56/3.21 % Success case prop solver time : 0.000
% 13.56/3.21 % Current number of processed clauses : 4153
% 13.56/3.21 % Positive orientable unit clauses : 2
% 13.56/3.21 % Positive unorientable unit clauses: 0
% 13.56/3.21 % Negative unit clauses : 4151
% 13.56/3.21 % Non-unit-clauses : 0
% 13.56/3.21 % Current number of unprocessed clauses: 7389
% 13.56/3.21 % ...number of literals in the above : 7389
% 13.56/3.21 % Current number of archived formulas : 0
% 13.56/3.21 % Current number of archived clauses : 3
% 13.56/3.21 % Clause-clause subsumption calls (NU) : 0
% 13.56/3.21 % Rec. Clause-clause subsumption calls : 0
% 13.56/3.21 % Non-unit clause-clause subsumptions : 0
% 13.56/3.21 % Unit Clause-clause subsumption calls : 2462610
% 13.56/3.21 % Rewrite failures with RHS unbound : 0
% 13.56/3.21 % BW rewrite match attempts : 4
% 13.56/3.21 % BW rewrite match successes : 0
% 13.56/3.21 % Condensation attempts : 0
% 13.56/3.21 % Condensation successes : 0
% 13.56/3.21 % Termbank termtop insertions : 2486917
% 13.56/3.21 % Search garbage collected termcells : 2
% 13.56/3.21
% 13.56/3.21 % -------------------------------------------------
% 13.56/3.21 % User time : 2.228 s
% 13.56/3.21 % System time : 0.340 s
% 13.56/3.21 % Total time : 2.568 s
% 13.56/3.21 % Maximum resident set size: 3376 pages
% 13.56/3.21
% 13.56/3.21 % -------------------------------------------------
% 13.56/3.21 % User time : 11.682 s
% 13.56/3.21 % System time : 1.721 s
% 13.56/3.21 % Total time : 13.403 s
% 13.56/3.21 % Maximum resident set size: 4608 pages
% 13.56/3.21 % E exiting
%------------------------------------------------------------------------------