%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL064-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:59 PM UTC 2026
% Result : Unsatisfiable 5.50s 1.58s
% Output : CNFRefutation 5.50s
% 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 : 11 ( 2 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_v_combinator,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(apply(h(X1),f(X1)),g(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_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(h(X1),f(X1)),g(X1)),
inference(fof_simplification,[status(thm)],[prove_v_combinator]) ).
cnf(c_0_4,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(apply(h(X1),f(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(h(apply(apply(b,X1),X2)),f(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(h(apply(apply(b,apply(t,X2)),X1)),f(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(h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),f(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(h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),f(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,apply(X2,f(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2)))))),apply(X3,g(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2)))))),h(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2))))) != apply(apply(h(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2)))),f(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2))))),g(apply(apply(b,apply(t,X3)),apply(apply(b,b),apply(apply(b,X1),X2))))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
apply(apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,b),apply(apply(b,b),X1))))),apply(apply(X2,g(apply(apply(b,apply(t,X2)),apply(apply(b,b),apply(apply(b,b),X1))))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),apply(apply(b,b),X1)))))) != apply(apply(h(apply(apply(b,apply(t,X2)),apply(apply(b,b),apply(apply(b,b),X1)))),f(apply(apply(b,apply(t,X2)),apply(apply(b,b),apply(apply(b,b),X1))))),g(apply(apply(b,apply(t,X2)),apply(apply(b,b),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,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t))))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t))))),f(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t))))) != apply(apply(h(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),apply(apply(b,b),t))))),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
apply(apply(apply(X1,apply(X2,g(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t)))))),h(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t))))),f(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t))))) != apply(apply(h(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),apply(apply(b,b),t))))),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_15,negated_conjecture,
apply(apply(X1,g(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),apply(apply(b,b),t))))),apply(h(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),apply(apply(b,b),t)))))) != apply(apply(h(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),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_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL064-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.10/0.37 % Computer : n008.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:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/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
% 5.50/1.58 % Version: 3.5.1
% 5.50/1.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.50/1.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.50/1.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.50/1.58 % Starting new_bool_3 with 300s (1) cores
% 5.50/1.58 % Starting new_bool_1 with 300s (1) cores
% 5.50/1.58 % Starting sh5l with 300s (1) cores
% 5.50/1.58 % new_bool_3 with pid 1181431 completed with status 9
% 5.50/1.58 % new_bool_1 with pid 1181432 completed with status 9
% 5.50/1.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1181430 completed with status 0
% 5.50/1.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.50/1.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.50/1.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.50/1.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.50/1.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.50/1.58 % No SInE strategy applied
% 5.50/1.58 % Search class: FUUPS-FFSF21-MFFFFFNN
% 5.50/1.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.50/1.58 % Starting SubtermCWHack with 136s (1) cores
% 5.50/1.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.50/1.58 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 5.50/1.58 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.50/1.58 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.50/1.58 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1181440 completed with status 0
% 5.50/1.58 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 5.50/1.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.50/1.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.50/1.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.50/1.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.50/1.58 % No SInE strategy applied
% 5.50/1.58 % Search class: FUUPS-FFSF21-MFFFFFNN
% 5.50/1.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.50/1.58 % Starting SubtermCWHack with 136s (1) cores
% 5.50/1.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.50/1.58 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 5.50/1.58 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.50/1.58 % Preprocessing time : 0.001 s
% 5.50/1.58 % Presaturation interreduction done
% 5.50/1.58
% 5.50/1.58 % Proof found!
% 5.50/1.58 % SZS status Unsatisfiable
% 5.50/1.58 % SZS output start CNFRefutation
% See solution above
% 5.50/1.58 % Parsed axioms : 3
% 5.50/1.58 % Removed by relevancy pruning/SinE : 0
% 5.50/1.58 % Initial clauses : 3
% 5.50/1.58 % Removed in clause preprocessing : 0
% 5.50/1.58 % Initial clauses in saturation : 3
% 5.50/1.58 % Processed clauses : 3240
% 5.50/1.58 % ...of these trivial : 0
% 5.50/1.58 % ...subsumed : 752
% 5.50/1.58 % ...remaining for further processing : 2488
% 5.50/1.58 % Other redundant clauses eliminated : 0
% 5.50/1.58 % Clauses deleted for lack of memory : 0
% 5.50/1.58 % Backward-subsumed : 0
% 5.50/1.58 % Backward-rewritten : 0
% 5.50/1.58 % Generated clauses : 7919
% 5.50/1.58 % ...of the previous two non-redundant : 7917
% 5.50/1.58 % ...aggressively subsumed : 0
% 5.50/1.58 % Contextual simplify-reflections : 0
% 5.50/1.58 % Paramodulations : 7919
% 5.50/1.58 % Factorizations : 0
% 5.50/1.58 % NegExts : 0
% 5.50/1.58 % Equation resolutions : 0
% 5.50/1.58 % Disequality decompositions : 0
% 5.50/1.58 % Total rewrite steps : 0
% 5.50/1.58 % ...of those cached : 0
% 5.50/1.58 % Propositional unsat checks : 0
% 5.50/1.58 % Propositional check models : 0
% 5.50/1.58 % Propositional check unsatisfiable : 0
% 5.50/1.58 % Propositional clauses : 0
% 5.50/1.58 % Propositional clauses after purity: 0
% 5.50/1.58 % Propositional unsat core size : 0
% 5.50/1.58 % Propositional preprocessing time : 0.000
% 5.50/1.58 % Propositional encoding time : 0.000
% 5.50/1.58 % Propositional solver time : 0.000
% 5.50/1.58 % Success case prop preproc time : 0.000
% 5.50/1.58 % Success case prop encoding time : 0.000
% 5.50/1.58 % Success case prop solver time : 0.000
% 5.50/1.58 % Current number of processed clauses : 2485
% 5.50/1.58 % Positive orientable unit clauses : 2
% 5.50/1.58 % Positive unorientable unit clauses: 0
% 5.50/1.58 % Negative unit clauses : 2483
% 5.50/1.58 % Non-unit-clauses : 0
% 5.50/1.58 % Current number of unprocessed clauses: 4681
% 5.50/1.58 % ...number of literals in the above : 4681
% 5.50/1.58 % Current number of archived formulas : 0
% 5.50/1.58 % Current number of archived clauses : 3
% 5.50/1.58 % Clause-clause subsumption calls (NU) : 0
% 5.50/1.58 % Rec. Clause-clause subsumption calls : 0
% 5.50/1.58 % Non-unit clause-clause subsumptions : 0
% 5.50/1.58 % Unit Clause-clause subsumption calls : 803349
% 5.50/1.58 % Rewrite failures with RHS unbound : 0
% 5.50/1.58 % BW rewrite match attempts : 2
% 5.50/1.58 % BW rewrite match successes : 0
% 5.50/1.58 % Condensation attempts : 0
% 5.50/1.58 % Condensation successes : 0
% 5.50/1.58 % Termbank termtop insertions : 1152545
% 5.50/1.58 % Search garbage collected termcells : 2
% 5.50/1.58
% 5.50/1.58 % -------------------------------------------------
% 5.50/1.58 % User time : 0.898 s
% 5.50/1.58 % System time : 0.168 s
% 5.50/1.58 % Total time : 1.066 s
% 5.50/1.58 % Maximum resident set size: 3376 pages
% 5.50/1.58
% 5.50/1.58 % -------------------------------------------------
% 5.50/1.58 % User time : 4.791 s
% 5.50/1.58 % System time : 0.772 s
% 5.50/1.58 % Total time : 5.563 s
% 5.50/1.58 % Maximum resident set size: 4608 pages
% 5.50/1.58 % E exiting
%------------------------------------------------------------------------------