%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV164+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:51 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 61 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 54 ( 18 ~; 12 |; 15 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ) ).
fof(cl5_nebula_norm_0014,conjecture,
( ( ! [X14] :
( ( leq(X14,pred(pv10))
& leq(n0,X14) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X18] :
( ( leq(X18,tptp_minus_1)
& leq(n0,X18) )
=> a_select3(q,pv10,X18) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X18)),minus(a_select2(x,pv10),a_select2(mu,X18))),tptp_minus_2),times(a_select2(sigma,X18),a_select2(sigma,X18)))),a_select2(rho,X18)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X18))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0014) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_6,plain,
! [X49,X50] :
( leq(X49,succ(X50))
| ~ leq(X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])])]) ).
fof(c_0_7,negated_conjecture,
~ ( ( ! [X14] :
( ( leq(X14,pred(pv10))
& leq(n0,X14) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X18] :
( ( leq(X18,tptp_minus_1)
& leq(n0,X18) )
=> a_select3(q,pv10,X18) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X18)),minus(a_select2(x,pv10),a_select2(mu,X18))),tptp_minus_2),times(a_select2(sigma,X18),a_select2(sigma,X18)))),a_select2(rho,X18)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X18))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0014]) ).
cnf(c_0_8,plain,
( ~ leq(X1,X2)
| leq(X1,succ(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_10,negated_conjecture,
! [X28] :
( a_select3(q,pv10,esk1_0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(esk1_0,tptp_minus_1)
& leq(n0,esk1_0)
& ( sum(n0,n4,a_select3(q,X28,tptp_sum_index)) = n1
| ~ leq(X28,pred(pv10))
| ~ leq(n0,X28) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_11,plain,
! [X51,X52] :
( ( leq(X51,X52)
| ~ gt(succ(X52),X51) )
& ( gt(succ(X52),X51)
| ~ leq(X51,X52) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])]) ).
fof(c_0_12,plain,
! [X40] :
( X40 = n0
| ~ leq(X40,n0)
| ~ leq(n0,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])])]) ).
cnf(c_0_13,plain,
( ~ leq(X1,tptp_minus_1)
| leq(X1,n0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_16,plain,
( ~ leq(X1,X2)
| gt(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ leq(X1,n0)
| ~ leq(n0,X1)
| X1 = n0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
leq(esk1_0,n0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X67] : ~ gt(X67,X67),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
gt(n0,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV164+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:35:00 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_1 with pid 3868176 completed with status 0
% 0.13/0.42 % Result found by new_bool_1
% 0.13/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.13/0.42 % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.13/0.42 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 3868178 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.13/0.42 % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.13/0.42 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.002 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 100
% 0.13/0.42 % Removed by relevancy pruning/SinE : 23
% 0.13/0.42 % Initial clauses : 85
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 85
% 0.13/0.42 % Processed clauses : 112
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 2
% 0.13/0.42 % ...remaining for further processing : 110
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 7
% 0.13/0.42 % Generated clauses : 141
% 0.13/0.42 % ...of the previous two non-redundant : 90
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 139
% 0.13/0.42 % Factorizations : 2
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 83
% 0.13/0.42 % ...of those cached : 55
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 103
% 0.13/0.42 % Positive orientable unit clauses : 69
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 4
% 0.13/0.42 % Non-unit-clauses : 30
% 0.13/0.42 % Current number of unprocessed clauses: 63
% 0.13/0.42 % ...number of literals in the above : 162
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 7
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 123
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 122
% 0.13/0.42 % Non-unit clause-clause subsumptions : 2
% 0.13/0.42 % Unit Clause-clause subsumption calls : 94
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 5
% 0.13/0.42 % BW rewrite match successes : 1
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 5519
% 0.13/0.42 % Search garbage collected termcells : 672
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.009 s
% 0.13/0.42 % System time : 0.000 s
% 0.13/0.42 % Total time : 0.009 s
% 0.13/0.42 % Maximum resident set size: 3752 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.011 s
% 0.13/0.42 % System time : 0.006 s
% 0.13/0.42 % Total time : 0.017 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------