%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL020-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 : 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:50 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_definition,axiom,
apply(apply(apply(c,X1),X2),X3) = apply(apply(X1,X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_definition) ).
cnf(s_definition,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
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(c_0_4,axiom,
apply(apply(apply(c,X1),X2),X3) = apply(apply(X1,X3),X2),
c_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
s_definition ).
cnf(c_0_6,negated_conjecture,
X1 != apply(combinator,X1),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_7,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_8,plain,
apply(apply(apply(s,apply(c,X1)),X2),X3) = apply(apply(X1,apply(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
X1 != apply(combinator,X1),
c_0_6 ).
cnf(c_0_10,plain,
apply(apply(apply(s,apply(c,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X3),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(s,apply(c,apply(b,combinator))),X1),X2) != apply(apply(X1,X2),X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL020-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/5.38 % Computer : n016.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 21 14:10:00 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_1 with pid 2619895 completed with status 9
% 0.15/5.46 % new_bool_3 with pid 2619894 completed with status 9
% 0.15/5.46 % sh5l with pid 2619896 completed with status 0
% 0.15/5.46 % Result found by sh5l
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.46 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 2619899 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.46 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Unsatisfiable
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 4
% 0.15/5.46 % Removed by relevancy pruning/SinE : 0
% 0.15/5.46 % Initial clauses : 4
% 0.15/5.46 % Removed in clause preprocessing : 0
% 0.15/5.46 % Initial clauses in saturation : 4
% 0.15/5.46 % Processed clauses : 25
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 4
% 0.15/5.46 % ...remaining for further processing : 21
% 0.15/5.46 % Other redundant clauses eliminated : 0
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 0
% 0.15/5.46 % Backward-rewritten : 0
% 0.15/5.46 % Generated clauses : 1456
% 0.15/5.46 % ...of the previous two non-redundant : 1364
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 0
% 0.15/5.46 % Paramodulations : 1455
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 1
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 86
% 0.15/5.46 % ...of those cached : 15
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 21
% 0.15/5.46 % Positive orientable unit clauses : 5
% 0.15/5.46 % Positive unorientable unit clauses: 13
% 0.15/5.46 % Negative unit clauses : 3
% 0.15/5.46 % Non-unit-clauses : 0
% 0.15/5.46 % Current number of unprocessed clauses: 1343
% 0.15/5.46 % ...number of literals in the above : 1343
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 0
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.46 % Non-unit clause-clause subsumptions : 0
% 0.15/5.46 % Unit Clause-clause subsumption calls : 6
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 309
% 0.15/5.46 % BW rewrite match successes : 4
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 28420
% 0.15/5.46 % Search garbage collected termcells : 2
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.022 s
% 0.15/5.46 % System time : 0.001 s
% 0.15/5.46 % Total time : 0.023 s
% 0.15/5.46 % Maximum resident set size: 3888 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.048 s
% 0.15/5.46 % System time : 0.021 s
% 0.15/5.46 % Total time : 0.069 s
% 0.15/5.46 % Maximum resident set size: 4864 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------