%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL044-3 : 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 : n005.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 0.25s 5.63s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 19 ( 16 unt; 0 nHn; 9 RR)
% Number of literals : 22 ( 15 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(strong_fixed_point,axiom,
( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
| fixed_point(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strong_fixed_point) ).
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(c_0_4,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).
cnf(c_0_5,plain,
( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
| fixed_point(X1) ),
inference(fof_simplification,[status(thm)],[strong_fixed_point]) ).
cnf(c_0_6,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_7,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_8,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
c_0_4 ).
cnf(c_0_9,plain,
( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
| fixed_point(X1) ),
c_0_5 ).
cnf(c_0_10,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_6,c_0_7]) ).
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_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(fixed_pt,apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n),apply(b,apply(b,fixed_pt)))) != apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n),apply(b,apply(b,fixed_pt))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_13,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_7,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_7,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
apply(fixed_pt,apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
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_6,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_7,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL044-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.46 % Computer : n005.cluster.edu
% 0.19/5.46 % Model : x86_64 x86_64
% 0.19/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46 % Memory : 8046.5625MB
% 0.19/5.46 % OS : Linux 6.8.0-71-generic
% 0.19/5.46 % CPULimit : 300
% 0.19/5.46 % WCLimit : 300
% 0.19/5.46 % DateTime : Mon Sep 21 14:06:38 UTC 2026
% 0.19/5.46 % CPUTime :
% 0.19/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/5.53 Running first-order theorem proving
% 0.25/5.53 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.25/5.63 % Version: 3.5.1
% 0.25/5.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.25/5.63 % Starting sh5l with 300s (1) cores
% 0.25/5.63 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3680732 completed with status 0
% 0.25/5.63 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/5.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.63 % No SInE strategy applied
% 0.25/5.63 % Search class: FHUSS-FFSF22-DFFFFFNN
% 0.25/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/5.63 % Starting U----_206e_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/5.63 % Starting new_bool_3 with 136s (1) cores
% 0.25/5.63 % U----_206e_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3680738 completed with status 0
% 0.25/5.63 % Result found by U----_206e_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.25/5.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.63 % No SInE strategy applied
% 0.25/5.63 % Search class: FHUSS-FFSF22-DFFFFFNN
% 0.25/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/5.63 % Starting U----_206e_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/5.63 % Preprocessing time : 0.002 s
% 0.25/5.63 % Presaturation interreduction done
% 0.25/5.63
% 0.25/5.63 % Proof found!
% 0.25/5.63 % SZS status Unsatisfiable
% 0.25/5.63 % SZS output start CNFRefutation
% See solution above
% 0.25/5.63 % Parsed axioms : 4
% 0.25/5.63 % Removed by relevancy pruning/SinE : 0
% 0.25/5.63 % Initial clauses : 4
% 0.25/5.63 % Removed in clause preprocessing : 0
% 0.25/5.63 % Initial clauses in saturation : 4
% 0.25/5.63 % Processed clauses : 32
% 0.25/5.63 % ...of these trivial : 0
% 0.25/5.63 % ...subsumed : 7
% 0.25/5.63 % ...remaining for further processing : 25
% 0.25/5.63 % Other redundant clauses eliminated : 0
% 0.25/5.63 % Clauses deleted for lack of memory : 0
% 0.25/5.63 % Backward-subsumed : 0
% 0.25/5.63 % Backward-rewritten : 3
% 0.25/5.63 % Generated clauses : 874
% 0.25/5.63 % ...of the previous two non-redundant : 752
% 0.25/5.63 % ...aggressively subsumed : 0
% 0.25/5.63 % Contextual simplify-reflections : 0
% 0.25/5.63 % Paramodulations : 874
% 0.25/5.63 % Factorizations : 0
% 0.25/5.63 % NegExts : 0
% 0.25/5.63 % Equation resolutions : 0
% 0.25/5.63 % Disequality decompositions : 0
% 0.25/5.63 % Total rewrite steps : 34
% 0.25/5.63 % ...of those cached : 7
% 0.25/5.63 % Propositional unsat checks : 0
% 0.25/5.63 % Propositional check models : 0
% 0.25/5.63 % Propositional check unsatisfiable : 0
% 0.25/5.63 % Propositional clauses : 0
% 0.25/5.63 % Propositional clauses after purity: 0
% 0.25/5.63 % Propositional unsat core size : 0
% 0.25/5.63 % Propositional preprocessing time : 0.000
% 0.25/5.63 % Propositional encoding time : 0.000
% 0.25/5.63 % Propositional solver time : 0.000
% 0.25/5.63 % Success case prop preproc time : 0.000
% 0.25/5.63 % Success case prop encoding time : 0.000
% 0.25/5.63 % Success case prop solver time : 0.000
% 0.25/5.63 % Current number of processed clauses : 18
% 0.25/5.63 % Positive orientable unit clauses : 2
% 0.25/5.63 % Positive unorientable unit clauses: 14
% 0.25/5.63 % Negative unit clauses : 1
% 0.25/5.63 % Non-unit-clauses : 1
% 0.25/5.63 % Current number of unprocessed clauses: 727
% 0.25/5.63 % ...number of literals in the above : 727
% 0.25/5.63 % Current number of archived formulas : 0
% 0.25/5.63 % Current number of archived clauses : 7
% 0.25/5.63 % Clause-clause subsumption calls (NU) : 0
% 0.25/5.63 % Rec. Clause-clause subsumption calls : 0
% 0.25/5.63 % Non-unit clause-clause subsumptions : 0
% 0.25/5.63 % Unit Clause-clause subsumption calls : 14
% 0.25/5.63 % Rewrite failures with RHS unbound : 0
% 0.25/5.63 % BW rewrite match attempts : 249
% 0.25/5.63 % BW rewrite match successes : 8
% 0.25/5.63 % Condensation attempts : 0
% 0.25/5.63 % Condensation successes : 0
% 0.25/5.63 % Termbank termtop insertions : 17858
% 0.25/5.63 % Search garbage collected termcells : 5
% 0.25/5.63
% 0.25/5.63 % -------------------------------------------------
% 0.25/5.63 % User time : 0.028 s
% 0.25/5.63 % System time : 0.008 s
% 0.25/5.63 % Total time : 0.035 s
% 0.25/5.63 % Maximum resident set size: 3644 pages
% 0.25/5.63
% 0.25/5.63 % -------------------------------------------------
% 0.25/5.63 % User time : 0.183 s
% 0.25/5.63 % System time : 0.025 s
% 0.25/5.63 % Total time : 0.208 s
% 0.25/5.63 % Maximum resident set size: 4608 pages
% 0.25/5.63 % E exiting
%------------------------------------------------------------------------------