%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN170-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 03:32:41 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.47s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 34 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_137,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_137) ).
cnf(rule_210,axiom,
ifeq(n2(X1),true,k3(X1,X1,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_210) ).
cnf(prove_this,negated_conjecture,
p4(X1,c,X2) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_287,axiom,
ifeq(k3(X1,X1,X2),true,p4(X1,X2,X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_287) ).
cnf(c_0_7,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_085 ).
cnf(c_0_8,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_9,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
rule_137 ).
cnf(c_0_11,plain,
p1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,axiom,
ifeq(n2(X1),true,k3(X1,X1,X1),true) = true,
rule_210 ).
cnf(c_0_13,plain,
n2(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
p4(X1,c,X2) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_15,axiom,
ifeq(k3(X1,X1,X2),true,p4(X1,X2,X1),true) = true,
rule_287 ).
cnf(c_0_16,plain,
k3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
p4(X1,c,X2) != true,
c_0_14 ).
cnf(c_0_18,plain,
p4(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN170-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n007.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 10:43:05 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.47 % Version: 3.5.1
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47 % Starting sh5l with 300s (1) cores
% 0.12/0.47 % new_bool_3 with pid 882883 completed with status 0
% 0.12/0.47 % Result found by new_bool_3
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FUUPM-FFLM32-MFFFFFNN
% 0.12/0.47 % partial match(1): FUUPM-FFMM32-MFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % SubtermCWHack with pid 882891 completed with status 0
% 0.12/0.47 % Result found by SubtermCWHack
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FUUPM-FFLM32-MFFFFFNN
% 0.12/0.47 % partial match(1): FUUPM-FFMM32-MFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % Preprocessing time : 0.004 s
% 0.12/0.47
% 0.12/0.47 % Proof found!
% 0.12/0.47 % SZS status Unsatisfiable
% 0.12/0.47 % SZS output start CNFRefutation
% See solution above
% 0.12/0.47 % Parsed axioms : 363
% 0.12/0.47 % Removed by relevancy pruning/SinE : 41
% 0.12/0.47 % Initial clauses : 322
% 0.12/0.47 % Removed in clause preprocessing : 0
% 0.12/0.47 % Initial clauses in saturation : 322
% 0.12/0.47 % Processed clauses : 304
% 0.12/0.47 % ...of these trivial : 20
% 0.12/0.47 % ...subsumed : 0
% 0.12/0.47 % ...remaining for further processing : 284
% 0.12/0.47 % Other redundant clauses eliminated : 0
% 0.12/0.47 % Clauses deleted for lack of memory : 0
% 0.12/0.47 % Backward-subsumed : 0
% 0.12/0.47 % Backward-rewritten : 158
% 0.12/0.47 % Generated clauses : 467
% 0.12/0.47 % ...of the previous two non-redundant : 198
% 0.12/0.47 % ...aggressively subsumed : 0
% 0.12/0.47 % Contextual simplify-reflections : 0
% 0.12/0.47 % Paramodulations : 467
% 0.12/0.47 % Factorizations : 0
% 0.12/0.47 % NegExts : 0
% 0.12/0.47 % Equation resolutions : 0
% 0.12/0.47 % Disequality decompositions : 0
% 0.12/0.47 % Total rewrite steps : 752
% 0.12/0.47 % ...of those cached : 406
% 0.12/0.47 % Propositional unsat checks : 0
% 0.12/0.47 % Propositional check models : 0
% 0.12/0.47 % Propositional check unsatisfiable : 0
% 0.12/0.47 % Propositional clauses : 0
% 0.12/0.47 % Propositional clauses after purity: 0
% 0.12/0.47 % Propositional unsat core size : 0
% 0.12/0.47 % Propositional preprocessing time : 0.000
% 0.12/0.47 % Propositional encoding time : 0.000
% 0.12/0.47 % Propositional solver time : 0.000
% 0.12/0.47 % Success case prop preproc time : 0.000
% 0.12/0.47 % Success case prop encoding time : 0.000
% 0.12/0.47 % Success case prop solver time : 0.000
% 0.12/0.47 % Current number of processed clauses : 126
% 0.12/0.47 % Positive orientable unit clauses : 125
% 0.12/0.47 % Positive unorientable unit clauses: 0
% 0.12/0.47 % Negative unit clauses : 1
% 0.12/0.47 % Non-unit-clauses : 0
% 0.12/0.47 % Current number of unprocessed clauses: 199
% 0.12/0.47 % ...number of literals in the above : 199
% 0.12/0.47 % Current number of archived formulas : 0
% 0.12/0.47 % Current number of archived clauses : 158
% 0.12/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.47 % Non-unit clause-clause subsumptions : 0
% 0.12/0.47 % Unit Clause-clause subsumption calls : 0
% 0.12/0.47 % Rewrite failures with RHS unbound : 0
% 0.12/0.47 % BW rewrite match attempts : 385
% 0.12/0.47 % BW rewrite match successes : 148
% 0.12/0.47 % Condensation attempts : 0
% 0.12/0.47 % Condensation successes : 0
% 0.12/0.47 % Termbank termtop insertions : 13504
% 0.12/0.47 % Search garbage collected termcells : 198
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.018 s
% 0.12/0.47 % System time : 0.006 s
% 0.12/0.47 % Total time : 0.024 s
% 0.12/0.47 % Maximum resident set size: 4136 pages
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.026 s
% 0.12/0.47 % System time : 0.011 s
% 0.12/0.47 % Total time : 0.037 s
% 0.12/0.47 % Maximum resident set size: 5120 pages
% 0.12/0.47 % E exiting
%------------------------------------------------------------------------------