%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM662_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 01:55:57 PM UTC 2026
% Result : Theorem 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 19 ( 19 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_23,type,
x: nat ).
tff(decl_24,type,
y: nat ).
tff(decl_25,type,
z: nat ).
tff(decl_26,type,
pl: ( nat * nat ) > nat ).
tff(decl_27,type,
esk1_0: nat ).
tff(decl_28,type,
esk2_0: nat ).
tff(satz15,conjecture,
~ ! [X1: nat] : ( z != pl(x,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz15) ).
tff(l,axiom,
~ ! [X1: nat] : ( y != pl(x,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(satz5,axiom,
! [X2: nat,X4: nat,X5: nat] : ( pl(pl(X2,X4),X5) = pl(X2,pl(X4,X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz5) ).
tff(k,axiom,
~ ! [X2: nat] : ( z != pl(y,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
tff(c_0_4,negated_conjecture,
~ ~ ! [X1: nat] : ( z != pl(x,X1) ),
inference(assume_negation,[status(cth)],[satz15]) ).
tff(c_0_5,plain,
~ ! [X1: nat] : ( y != pl(x,X1) ),
inference(fof_simplification,[status(thm)],[l]) ).
tff(c_0_6,negated_conjecture,
~ ~ ! [X1: nat] : ( z != pl(x,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
tff(c_0_7,plain,
! [X7: nat,X8: nat,X9: nat] : ( pl(pl(X7,X8),X9) = pl(X7,pl(X8,X9)) ),
inference(variable_rename,[status(thm)],[satz5]) ).
tff(c_0_8,plain,
y = pl(x,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tff(c_0_9,plain,
~ ! [X2: nat] : ( z != pl(y,X2) ),
inference(fof_simplification,[status(thm)],[k]) ).
tff(c_0_10,negated_conjecture,
! [X6: nat] : ( z != pl(x,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tcf(c_0_11,plain,
! [X1: nat,X2: nat,X4: nat] : pl(pl(X1,X2),X4) = pl(X1,pl(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
y = pl(x,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_13,plain,
z = pl(y,esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
tcf(c_0_14,negated_conjecture,
! [X1: nat] : z != pl(x,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,plain,
! [X1: nat] : pl(x,pl(esk1_0,X1)) = pl(y,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_16,plain,
z = pl(y,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_17,negated_conjecture,
! [X1: nat] : pl(y,X1) != z,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM662_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.39 % Computer : n008.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Mon Sep 21 02:51:15 UTC 2026
% 0.10/5.40 % CPUTime :
% 0.10/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_1 with pid 4183540 completed with status 0
% 0.15/5.46 % Result found by new_bool_1
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FUUPF-FFSF22-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 4183546 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FUUPF-FFSF22-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Theorem
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 10
% 0.15/5.46 % Removed by relevancy pruning/SinE : 6
% 0.15/5.46 % Initial clauses : 4
% 0.15/5.46 % Removed in clause preprocessing : 0
% 0.15/5.46 % Initial clauses in saturation : 4
% 0.15/5.46 % Processed clauses : 8
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 0
% 0.15/5.46 % ...remaining for further processing : 8
% 0.15/5.46 % Other redundant clauses eliminated : 0
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 0
% 0.15/5.46 % Backward-rewritten : 0
% 0.15/5.46 % Generated clauses : 9
% 0.15/5.46 % ...of the previous two non-redundant : 4
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 0
% 0.15/5.46 % Paramodulations : 8
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 0
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 9
% 0.15/5.46 % ...of those cached : 0
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 7
% 0.15/5.46 % Positive orientable unit clauses : 4
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 3
% 0.15/5.46 % Non-unit-clauses : 0
% 0.15/5.46 % Current number of unprocessed clauses: 0
% 0.15/5.46 % ...number of literals in the above : 0
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 1
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.46 % Non-unit clause-clause subsumptions : 0
% 0.15/5.46 % Unit Clause-clause subsumption calls : 2
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 0
% 0.15/5.46 % BW rewrite match successes : 0
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 305
% 0.15/5.46 % Search garbage collected termcells : 36
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.004 s
% 0.15/5.46 % System time : 0.001 s
% 0.15/5.46 % Total time : 0.005 s
% 0.15/5.46 % Maximum resident set size: 3584 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.006 s
% 0.15/5.46 % System time : 0.005 s
% 0.15/5.46 % Total time : 0.011 s
% 0.15/5.46 % Maximum resident set size: 4608 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------