%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL075-2 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:02 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 9 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(abstraction,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,apply(k,X3)),apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',abstraction) ).
cnf(k_definition,axiom,
apply(apply(k,X1),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_definition) ).
cnf(prove_diagonal_combinator,negated_conjecture,
apply(apply(X1,b(X1)),c(X1)) != apply(b(X1),b(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_diagonal_combinator) ).
cnf(c_0_3,axiom,
apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,apply(k,X3)),apply(X2,X3)),
abstraction ).
cnf(c_0_4,axiom,
apply(apply(k,X1),X2) = X1,
k_definition ).
cnf(c_0_5,negated_conjecture,
apply(apply(X1,b(X1)),c(X1)) != apply(b(X1),b(X1)),
inference(fof_simplification,[status(thm)],[prove_diagonal_combinator]) ).
cnf(c_0_6,plain,
apply(apply(apply(abstraction,X1),apply(k,X2)),X3) = apply(apply(X1,apply(k,X3)),X2),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
apply(apply(X1,b(X1)),c(X1)) != apply(b(X1),b(X1)),
c_0_5 ).
cnf(c_0_8,plain,
apply(apply(apply(apply(abstraction,abstraction),k),X1),X2) = apply(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_4]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : COL075-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 21 14:08:09 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % sh5l with pid 2536649 completed with status 0
% 0.07/0.34 % Result found by sh5l
% 0.07/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.34 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.34 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 2536655 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.34 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.34 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Unsatisfiable
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 3
% 0.07/0.34 % Removed by relevancy pruning/SinE : 0
% 0.07/0.34 % Initial clauses : 3
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 3
% 0.07/0.34 % Processed clauses : 15
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 0
% 0.07/0.34 % ...remaining for further processing : 15
% 0.07/0.34 % Other redundant clauses eliminated : 0
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 0
% 0.07/0.34 % Backward-rewritten : 0
% 0.07/0.34 % Generated clauses : 118
% 0.07/0.34 % ...of the previous two non-redundant : 102
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 0
% 0.07/0.34 % Paramodulations : 118
% 0.07/0.34 % Factorizations : 0
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 0
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 67
% 0.07/0.34 % ...of those cached : 15
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 15
% 0.07/0.34 % Positive orientable unit clauses : 10
% 0.07/0.34 % Positive unorientable unit clauses: 1
% 0.07/0.34 % Negative unit clauses : 4
% 0.07/0.34 % Non-unit-clauses : 0
% 0.07/0.34 % Current number of unprocessed clauses: 64
% 0.07/0.34 % ...number of literals in the above : 64
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 0
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.34 % Non-unit clause-clause subsumptions : 0
% 0.07/0.34 % Unit Clause-clause subsumption calls : 7
% 0.07/0.34 % Rewrite failures with RHS unbound : 4
% 0.07/0.34 % BW rewrite match attempts : 77
% 0.07/0.34 % BW rewrite match successes : 4
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 2708
% 0.07/0.34 % Search garbage collected termcells : 2
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.001 s
% 0.07/0.34 % System time : 0.002 s
% 0.07/0.34 % Total time : 0.004 s
% 0.07/0.34 % Maximum resident set size: 3372 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.001 s
% 0.07/0.34 % System time : 0.006 s
% 0.07/0.34 % Total time : 0.007 s
% 0.07/0.34 % Maximum resident set size: 4608 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------