%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:53:34 PM UTC 2026
% Result : Theorem 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 66 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 16 ~; 10 |; 14 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_init_0077,conjecture,
( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X14] :
( ( leq(X14,n2)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,minus(n0,n1))
& leq(n0,X18) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X18,X14) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(X1,n0)
& leq(n0,X1) )
=> X1 = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_8,negated_conjecture,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X14] :
( ( leq(X14,n2)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,minus(n0,n1))
& leq(n0,X18) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X18,X14) = init ) ) ),
inference(assume_negation,[status(cth)],[gauss_init_0077]) ).
fof(c_0_9,plain,
! [X83] : pred(succ(X83)) = X83,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_10,plain,
! [X52,X53] :
( leq(X52,succ(X53))
| ~ leq(X52,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])])]) ).
fof(c_0_11,negated_conjecture,
( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),esk2_0,esk1_0) != init
& leq(esk2_0,minus(n0,n1))
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(n0,esk1_0)
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_12,plain,
! [X60] : minus(X60,n1) = pred(X60),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_13,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_15,plain,
( ~ leq(X1,X2)
| leq(X1,succ(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X54,X55] :
( ( leq(X54,X55)
| ~ gt(succ(X55),X54) )
& ( gt(succ(X55),X54)
| ~ leq(X54,X55) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])]) ).
fof(c_0_20,plain,
! [X41] :
( X41 = n0
| ~ leq(X41,n0)
| ~ leq(n0,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])])]) ).
cnf(c_0_21,plain,
( ~ leq(X1,tptp_minus_1)
| leq(X1,n0) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
leq(esk2_0,tptp_minus_1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
fof(c_0_23,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_24,plain,
( ~ leq(X1,X2)
| gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ leq(X1,n0)
| ~ leq(n0,X1)
| X1 = n0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
leq(esk2_0,n0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
! [X71] : ~ gt(X71,X71),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
gt(n0,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_14]) ).
cnf(c_0_30,negated_conjecture,
esk2_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n012.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:28:37 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % new_bool_1 with pid 1986339 completed with status 0
% 0.12/0.43 % Result found by new_bool_1
% 0.12/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.12/0.43 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.12/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 1986341 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGUSM-FFMM32-MFFFFFNN
% 0.12/0.43 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.12/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.43 % Preprocessing time : 0.002 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 100
% 0.12/0.43 % Removed by relevancy pruning/SinE : 22
% 0.12/0.43 % Initial clauses : 88
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 88
% 0.12/0.43 % Processed clauses : 123
% 0.12/0.43 % ...of these trivial : 0
% 0.12/0.43 % ...subsumed : 2
% 0.12/0.43 % ...remaining for further processing : 121
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 0
% 0.12/0.43 % Backward-rewritten : 10
% 0.12/0.43 % Generated clauses : 135
% 0.12/0.43 % ...of the previous two non-redundant : 92
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 133
% 0.12/0.43 % Factorizations : 2
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 81
% 0.12/0.43 % ...of those cached : 50
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 111
% 0.12/0.43 % Positive orientable unit clauses : 71
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 9
% 0.12/0.43 % Non-unit-clauses : 31
% 0.12/0.43 % Current number of unprocessed clauses: 57
% 0.12/0.43 % ...number of literals in the above : 150
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 10
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 56
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 55
% 0.12/0.43 % Non-unit clause-clause subsumptions : 1
% 0.12/0.43 % Unit Clause-clause subsumption calls : 42
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 7
% 0.12/0.43 % BW rewrite match successes : 4
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 5297
% 0.12/0.43 % Search garbage collected termcells : 682
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.009 s
% 0.12/0.43 % System time : 0.002 s
% 0.12/0.43 % Total time : 0.011 s
% 0.12/0.43 % Maximum resident set size: 3744 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.011 s
% 0.12/0.43 % System time : 0.007 s
% 0.12/0.43 % Total time : 0.018 s
% 0.12/0.43 % Maximum resident set size: 4864 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------