%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL044-8 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:24 PM UTC 2026
% Result : Unsatisfiable 223.38s 32.61s
% Output : CNFRefutation 223.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 23 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_definition) ).
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(strong_fixed_point,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(prove_strong_fixed_point,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
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,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),
strong_fixed_point ).
cnf(c_0_7,plain,
apply(apply(apply(n,apply(X1,X2)),X2),X3) = apply(apply(apply(n,apply(n,X1)),X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(apply(b,X1),X2)),X3),X4) = apply(apply(apply(X1,apply(X2,X4)),X3),X4),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,plain,
apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n),apply(b,apply(b,X1))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_10,plain,
apply(apply(apply(n,apply(X1,apply(X2,X3))),X3),X4) = apply(apply(apply(n,apply(n,apply(apply(b,X1),X2))),X3),X4),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_11,plain,
apply(apply(apply(n,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_12,plain,
apply(apply(apply(n,apply(apply(b,b),X1)),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_13,plain,
apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(apply(b,b),n)),n))),n),apply(b,apply(b,X1))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
apply(apply(apply(apply(n,apply(b,b)),X1),X2),X3) = apply(apply(X2,X1),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7]) ).
cnf(c_0_16,plain,
apply(apply(apply(n,apply(n,apply(b,b))),X1),X2) = apply(apply(X1,X2),apply(X1,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X3,X2),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_18,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X1)))),apply(n,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_20,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),apply(n,apply(b,apply(b,X2)))),apply(n,apply(b,apply(b,X2)))) = apply(X1,apply(strong_fixed_point,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
c_0_19 ).
cnf(c_0_22,plain,
apply(X1,apply(strong_fixed_point,X1)) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COL044-8 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n020.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 14:07:48 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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
% 223.38/32.61 % Version: 3.5.1
% 223.38/32.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 223.38/32.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 223.38/32.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 223.38/32.61 % Starting new_bool_3 with 300s (1) cores
% 223.38/32.61 % Starting new_bool_1 with 300s (1) cores
% 223.38/32.61 % Starting sh5l with 300s (1) cores
% 223.38/32.61 % new_bool_3 with pid 3130206 completed with status 0
% 223.38/32.61 % Result found by new_bool_3
% 223.38/32.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 223.38/32.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 223.38/32.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 223.38/32.61 % Starting new_bool_3 with 300s (1) cores
% 223.38/32.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 223.38/32.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 223.38/32.61 % Search class: FUUPS-FFSF22-DFFFFFNN
% 223.38/32.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 223.38/32.61 % Starting SubtermCWHack with 31s (1) cores
% 223.38/32.61 % SubtermCWHack with pid 3130212 completed with status 8
% 223.38/32.61 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 223.38/32.61 % Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 3130377 completed with status 0
% 223.38/32.61 % Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 223.38/32.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 223.38/32.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 223.38/32.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 223.38/32.61 % Starting new_bool_3 with 300s (1) cores
% 223.38/32.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 223.38/32.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 223.38/32.61 % Search class: FUUPS-FFSF22-DFFFFFNN
% 223.38/32.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 223.38/32.61 % Starting SubtermCWHack with 31s (1) cores
% 223.38/32.61 % SubtermCWHack with pid 3130212 completed with status 8
% 223.38/32.61 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 223.38/32.61 % Preprocessing time : 0.001 s
% 223.38/32.61 % Presaturation interreduction done
% 223.38/32.61
% 223.38/32.61 % Proof found!
% 223.38/32.61 % SZS status Unsatisfiable
% 223.38/32.61 % SZS output start CNFRefutation
% See solution above
% 223.38/32.61 % Parsed axioms : 4
% 223.38/32.61 % Removed by relevancy pruning/SinE : 0
% 223.38/32.61 % Initial clauses : 4
% 223.38/32.61 % Removed in clause preprocessing : 0
% 223.38/32.61 % Initial clauses in saturation : 4
% 223.38/32.61 % Processed clauses : 395
% 223.38/32.61 % ...of these trivial : 106
% 223.38/32.61 % ...subsumed : 148
% 223.38/32.61 % ...remaining for further processing : 141
% 223.38/32.61 % Other redundant clauses eliminated : 0
% 223.38/32.61 % Clauses deleted for lack of memory : 0
% 223.38/32.61 % Backward-subsumed : 0
% 223.38/32.61 % Backward-rewritten : 11
% 223.38/32.61 % Generated clauses : 27150
% 223.38/32.61 % ...of the previous two non-redundant : 26661
% 223.38/32.61 % ...aggressively subsumed : 0
% 223.38/32.61 % Contextual simplify-reflections : 0
% 223.38/32.61 % Paramodulations : 27150
% 223.38/32.61 % Factorizations : 0
% 223.38/32.61 % NegExts : 0
% 223.38/32.61 % Equation resolutions : 0
% 223.38/32.61 % Disequality decompositions : 0
% 223.38/32.61 % Total rewrite steps : 5872
% 223.38/32.61 % ...of those cached : 1648
% 223.38/32.61 % Propositional unsat checks : 0
% 223.38/32.61 % Propositional check models : 0
% 223.38/32.61 % Propositional check unsatisfiable : 0
% 223.38/32.61 % Propositional clauses : 0
% 223.38/32.61 % Propositional clauses after purity: 0
% 223.38/32.61 % Propositional unsat core size : 0
% 223.38/32.61 % Propositional preprocessing time : 0.000
% 223.38/32.61 % Propositional encoding time : 0.000
% 223.38/32.61 % Propositional solver time : 0.000
% 223.38/32.61 % Success case prop preproc time : 0.000
% 223.38/32.61 % Success case prop encoding time : 0.000
% 223.38/32.61 % Success case prop solver time : 0.000
% 223.38/32.61 % Current number of processed clauses : 126
% 223.38/32.61 % Positive orientable unit clauses : 70
% 223.38/32.61 % Positive unorientable unit clauses: 56
% 223.38/32.61 % Negative unit clauses : 0
% 223.38/32.61 % Non-unit-clauses : 0
% 223.38/32.61 % Current number of unprocessed clauses: 26267
% 223.38/32.61 % ...number of literals in the above : 26267
% 223.38/32.61 % Current number of archived formulas : 0
% 223.38/32.61 % Current number of archived clauses : 15
% 223.38/32.61 % Clause-clause subsumption calls (NU) : 0
% 223.38/32.61 % Rec. Clause-clause subsumption calls : 0
% 223.38/32.61 % Non-unit clause-clause subsumptions : 0
% 223.38/32.61 % Unit Clause-clause subsumption calls : 831
% 223.38/32.61 % Rewrite failures with RHS unbound : 0
% 223.38/32.61 % BW rewrite match attempts : 9435
% 223.38/32.61 % BW rewrite match successes : 70
% 223.38/32.61 % Condensation attempts : 0
% 223.38/32.61 % Condensation successes : 0
% 223.38/32.61 % Termbank termtop insertions : 923468
% 223.38/32.61 % Search garbage collected termcells : 2
% 223.38/32.61
% 223.38/32.61 % -------------------------------------------------
% 223.38/32.61 % User time : 30.810 s
% 223.38/32.61 % System time : 0.900 s
% 223.38/32.61 % Total time : 31.710 s
% 223.38/32.61 % Maximum resident set size: 3588 pages
% 223.38/32.61
% 223.38/32.61 % -------------------------------------------------
% 223.38/32.61 % User time : 30.813 s
% 223.38/32.61 % System time : 0.907 s
% 223.38/32.61 % Total time : 31.720 s
% 223.38/32.61 % Maximum resident set size: 4864 pages
% 223.38/32.61 % E exiting
%------------------------------------------------------------------------------