%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COL044-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 : n003.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:54 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.48s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 12 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition) ).
cnf(prove_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_0_3,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_4,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_5,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).
cnf(c_0_6,plain,
apply(apply(apply(n,b),X1),X2) = apply(X2,apply(X1,X2)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
c_0_5 ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(n,b)),X1),X2) = apply(apply(X1,apply(X2,X1)),X2),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(n,b),X1),f(X1)) != apply(X1,f(X1)),
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
apply(apply(apply(n,apply(n,b)),apply(b,X1)),X2) = apply(X1,apply(apply(X2,apply(b,X1)),X2)),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
apply(apply(apply(apply(n,apply(n,b)),apply(b,apply(n,b))),X1),f(apply(apply(X1,apply(b,apply(n,b))),X1))) != apply(apply(apply(X1,apply(b,apply(n,b))),X1),f(apply(apply(X1,apply(b,apply(n,b))),X1))),
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 : COL044-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n003.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:01 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 0.30/0.48 % Version: 3.5.1
% 0.30/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.48 % Starting sh5l with 300s (1) cores
% 0.30/0.48 % new_bool_3 with pid 302633 completed with status 9
% 0.30/0.48 % new_bool_1 with pid 302634 completed with status 9
% 0.30/0.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 302632 completed with status 0
% 0.30/0.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.30/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.48 % No SInE strategy applied
% 0.30/0.48 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.30/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.30/0.48 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.30/0.48 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/0.48 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/0.48 % U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 302640 completed with status 0
% 0.30/0.48 % Result found by U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.48 % No SInE strategy applied
% 0.30/0.48 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.30/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.30/0.48 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.30/0.48 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/0.48 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/0.48 % Preprocessing time : 0.001 s
% 0.30/0.48 % Presaturation interreduction done
% 0.30/0.48
% 0.30/0.48 % Proof found!
% 0.30/0.48 % SZS status Unsatisfiable
% 0.30/0.48 % SZS output start CNFRefutation
% See solution above
% 0.30/0.48 % Parsed axioms : 3
% 0.30/0.48 % Removed by relevancy pruning/SinE : 0
% 0.30/0.48 % Initial clauses : 3
% 0.30/0.48 % Removed in clause preprocessing : 0
% 0.30/0.48 % Initial clauses in saturation : 3
% 0.30/0.48 % Processed clauses : 120
% 0.30/0.48 % ...of these trivial : 6
% 0.30/0.48 % ...subsumed : 59
% 0.30/0.48 % ...remaining for further processing : 55
% 0.30/0.48 % Other redundant clauses eliminated : 0
% 0.30/0.48 % Clauses deleted for lack of memory : 0
% 0.30/0.48 % Backward-subsumed : 0
% 0.30/0.48 % Backward-rewritten : 4
% 0.30/0.48 % Generated clauses : 3008
% 0.30/0.48 % ...of the previous two non-redundant : 2919
% 0.30/0.48 % ...aggressively subsumed : 0
% 0.30/0.48 % Contextual simplify-reflections : 0
% 0.30/0.48 % Paramodulations : 3007
% 0.30/0.48 % Factorizations : 0
% 0.30/0.48 % NegExts : 0
% 0.30/0.48 % Equation resolutions : 1
% 0.30/0.48 % Disequality decompositions : 0
% 0.30/0.48 % Total rewrite steps : 738
% 0.30/0.48 % ...of those cached : 519
% 0.30/0.48 % Propositional unsat checks : 0
% 0.30/0.48 % Propositional check models : 0
% 0.30/0.48 % Propositional check unsatisfiable : 0
% 0.30/0.48 % Propositional clauses : 0
% 0.30/0.48 % Propositional clauses after purity: 0
% 0.30/0.48 % Propositional unsat core size : 0
% 0.30/0.48 % Propositional preprocessing time : 0.000
% 0.30/0.48 % Propositional encoding time : 0.000
% 0.30/0.48 % Propositional solver time : 0.000
% 0.30/0.48 % Success case prop preproc time : 0.000
% 0.30/0.48 % Success case prop encoding time : 0.000
% 0.30/0.48 % Success case prop solver time : 0.000
% 0.30/0.48 % Current number of processed clauses : 48
% 0.30/0.48 % Positive orientable unit clauses : 7
% 0.30/0.48 % Positive unorientable unit clauses: 22
% 0.30/0.48 % Negative unit clauses : 19
% 0.30/0.48 % Non-unit-clauses : 0
% 0.30/0.48 % Current number of unprocessed clauses: 2794
% 0.30/0.48 % ...number of literals in the above : 2794
% 0.30/0.48 % Current number of archived formulas : 0
% 0.30/0.48 % Current number of archived clauses : 7
% 0.30/0.48 % Clause-clause subsumption calls (NU) : 0
% 0.30/0.48 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.48 % Non-unit clause-clause subsumptions : 0
% 0.30/0.48 % Unit Clause-clause subsumption calls : 131
% 0.30/0.48 % Rewrite failures with RHS unbound : 0
% 0.30/0.48 % BW rewrite match attempts : 455
% 0.30/0.48 % BW rewrite match successes : 10
% 0.30/0.48 % Condensation attempts : 0
% 0.30/0.48 % Condensation successes : 0
% 0.30/0.48 % Termbank termtop insertions : 101321
% 0.30/0.48 % Search garbage collected termcells : 2
% 0.30/0.48
% 0.30/0.48 % -------------------------------------------------
% 0.30/0.48 % User time : 0.042 s
% 0.30/0.48 % System time : 0.005 s
% 0.30/0.48 % Total time : 0.047 s
% 0.30/0.48 % Maximum resident set size: 3628 pages
% 0.30/0.48
% 0.30/0.48 % -------------------------------------------------
% 0.30/0.48 % User time : 0.232 s
% 0.30/0.48 % System time : 0.053 s
% 0.30/0.48 % Total time : 0.285 s
% 0.30/0.48 % Maximum resident set size: 4608 pages
% 0.30/0.48 % E exiting
%------------------------------------------------------------------------------