%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV488+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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 02:55:45 PM UTC 2026
% Result : Theorem 0.27s 0.57s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 133 ( 40 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 149 ( 46 ~; 36 |; 41 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 2 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(uti,conjecture,
! [X1,X2] :
( ( int_leq(X1,n)
& int_leq(X2,X1)
& int_leq(int_one,X2) )
=> ( X1 = X2
=> a(X1,X2) != real_zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uti) ).
fof(real_constants,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants) ).
fof(qii,hypothesis,
! [X1,X2] :
( ( int_leq(X2,n)
& int_leq(int_one,X2)
& int_leq(X1,n)
& int_leq(int_one,X1) )
=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = real_zero ) )
& ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qii) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( X1 = X2
| int_less(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(X1,n)
& int_leq(X2,X1)
& int_leq(int_one,X2) )
=> ( X1 = X2
=> a(X1,X2) != real_zero ) ),
inference(assume_negation,[status(cth)],[uti]) ).
fof(c_0_5,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = real_zero ) )
& ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(X1,n)
& int_leq(X2,X1)
& int_leq(int_one,X2) )
=> ( X1 = X2
=> a(X1,X2) != real_zero ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = real_zero ) )
& ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
( a(esk2_0,esk3_0) = real_zero
& esk2_0 = esk3_0
& int_leq(esk2_0,n)
& int_leq(esk3_0,esk2_0)
& int_leq(int_one,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
real_zero != real_one,
inference(fof_simplification,[status(thm)],[real_constants]) ).
fof(c_0_10,plain,
! [X36,X37,X38,X39,X40,X41,X42] :
( ( ~ epred1_2(X37,X36)
| a(X42,plus(X42,X41)) = real_zero
| ~ int_leq(X42,X37)
| ~ int_leq(int_one,X42)
| X36 != plus(X37,X41)
| ~ int_less(int_zero,X41) )
& ( ~ epred1_2(X37,X36)
| a(X40,X40) = real_one
| ~ int_leq(X40,X36)
| ~ int_leq(int_one,X40) )
& ( ~ epred1_2(X37,X36)
| a(plus(X39,X38),X39) = real_zero
| ~ int_leq(X39,X36)
| ~ int_leq(int_one,X39)
| X37 != plus(X36,X38)
| ~ int_less(int_zero,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_11,negated_conjecture,
int_leq(int_one,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
a(esk2_0,esk3_0) = real_zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
real_zero != real_one,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_15,hypothesis,
! [X1,X2] :
( ( int_leq(X2,n)
& int_leq(int_one,X2)
& int_leq(X1,n)
& int_leq(int_one,X1) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[qii,c_0_5]) ).
cnf(c_0_16,plain,
( ~ epred1_2(X3,X2)
| ~ int_leq(X1,X2)
| ~ int_leq(int_one,X1)
| a(X1,X1) = real_one ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
int_leq(int_one,esk2_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
a(esk2_0,esk2_0) = real_zero,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,plain,
real_zero != real_one,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,hypothesis,
! [X32,X33] :
( epred1_2(X32,X33)
| ~ int_leq(X33,n)
| ~ int_leq(int_one,X33)
| ~ int_leq(X32,n)
| ~ int_leq(int_one,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_21,plain,
! [X9,X10] :
( ( int_leq(X9,X10)
| X9 != X10 )
& ( int_leq(X9,X10)
| ~ int_less(X9,X10) )
& ( X9 = X10
| int_less(X9,X10)
| ~ int_leq(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ int_leq(esk2_0,X2)
| ~ epred1_2(X1,X2) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_23,hypothesis,
( ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( X1 != X2
| int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
( ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
int_leq(esk2_0,n),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,hypothesis,
( ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV488+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n010.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 08:54:55 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.51 Running first-order theorem proving
% 0.18/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
% 0.27/0.57 % Version: 3.5.1
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.57 % Starting sh5l with 300s (1) cores
% 0.27/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 530976 completed with status 0
% 0.27/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.57 % No SInE strategy applied
% 0.27/0.57 % Search class: FGHSS-FFMM22-SFFFFFNN
% 0.27/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.27/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.27/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 530984 completed with status 0
% 0.27/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.57 % No SInE strategy applied
% 0.27/0.57 % Search class: FGHSS-FFMM22-SFFFFFNN
% 0.27/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.57 % Preprocessing time : 0.002 s
% 0.27/0.57 % Presaturation interreduction done
% 0.27/0.57
% 0.27/0.57 % Proof found!
% 0.27/0.57 % SZS status Theorem
% 0.27/0.57 % SZS output start CNFRefutation
% See solution above
% 0.27/0.57 % Parsed axioms : 13
% 0.27/0.57 % Removed by relevancy pruning/SinE : 0
% 0.27/0.57 % Initial clauses : 25
% 0.27/0.57 % Removed in clause preprocessing : 0
% 0.27/0.57 % Initial clauses in saturation : 25
% 0.27/0.57 % Processed clauses : 104
% 0.27/0.57 % ...of these trivial : 1
% 0.27/0.57 % ...subsumed : 14
% 0.27/0.57 % ...remaining for further processing : 89
% 0.27/0.57 % Other redundant clauses eliminated : 5
% 0.27/0.57 % Clauses deleted for lack of memory : 0
% 0.27/0.57 % Backward-subsumed : 7
% 0.27/0.57 % Backward-rewritten : 1
% 0.27/0.57 % Generated clauses : 171
% 0.27/0.57 % ...of the previous two non-redundant : 136
% 0.27/0.57 % ...aggressively subsumed : 0
% 0.27/0.57 % Contextual simplify-reflections : 2
% 0.27/0.57 % Paramodulations : 164
% 0.27/0.57 % Factorizations : 2
% 0.27/0.57 % NegExts : 0
% 0.27/0.57 % Equation resolutions : 5
% 0.27/0.57 % Disequality decompositions : 0
% 0.27/0.57 % Total rewrite steps : 44
% 0.27/0.57 % ...of those cached : 29
% 0.27/0.57 % Propositional unsat checks : 0
% 0.27/0.57 % Propositional check models : 0
% 0.27/0.57 % Propositional check unsatisfiable : 0
% 0.27/0.57 % Propositional clauses : 0
% 0.27/0.57 % Propositional clauses after purity: 0
% 0.27/0.57 % Propositional unsat core size : 0
% 0.27/0.57 % Propositional preprocessing time : 0.000
% 0.27/0.57 % Propositional encoding time : 0.000
% 0.27/0.57 % Propositional solver time : 0.000
% 0.27/0.57 % Success case prop preproc time : 0.000
% 0.27/0.57 % Success case prop encoding time : 0.000
% 0.27/0.57 % Success case prop solver time : 0.000
% 0.27/0.57 % Current number of processed clauses : 52
% 0.27/0.57 % Positive orientable unit clauses : 9
% 0.27/0.57 % Positive unorientable unit clauses: 1
% 0.27/0.57 % Negative unit clauses : 3
% 0.27/0.57 % Non-unit-clauses : 39
% 0.27/0.57 % Current number of unprocessed clauses: 73
% 0.27/0.57 % ...number of literals in the above : 262
% 0.27/0.57 % Current number of archived formulas : 0
% 0.27/0.57 % Current number of archived clauses : 32
% 0.27/0.57 % Clause-clause subsumption calls (NU) : 236
% 0.27/0.57 % Rec. Clause-clause subsumption calls : 121
% 0.27/0.57 % Non-unit clause-clause subsumptions : 20
% 0.27/0.57 % Unit Clause-clause subsumption calls : 1
% 0.27/0.57 % Rewrite failures with RHS unbound : 0
% 0.27/0.57 % BW rewrite match attempts : 10
% 0.27/0.57 % BW rewrite match successes : 5
% 0.27/0.57 % Condensation attempts : 0
% 0.27/0.57 % Condensation successes : 0
% 0.27/0.57 % Termbank termtop insertions : 3606
% 0.27/0.57 % Search garbage collected termcells : 387
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.015 s
% 0.27/0.57 % System time : 0.006 s
% 0.27/0.57 % Total time : 0.021 s
% 0.27/0.57 % Maximum resident set size: 3644 pages
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.050 s
% 0.27/0.57 % System time : 0.016 s
% 0.27/0.57 % Total time : 0.066 s
% 0.27/0.57 % Maximum resident set size: 4608 pages
% 0.27/0.57 % E exiting
%------------------------------------------------------------------------------