TSTP Solution File: SWV163+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV163+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:43:36 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 67 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 56 ( 19 ~; 13 |; 15 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',pred_succ) ).
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',leq_succ) ).
fof(cl5_nebula_norm_0013,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> a_select3(q,pv10,X18) = divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',cl5_nebula_norm_0013) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',leq_gt_pred) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',succ_tptp_minus_1) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',finite_domain_0) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.q4hulVM93G/E---3.1_952.p',irreflexivity_gt) ).
fof(c_0_7,plain,
! [X60] : pred(succ(X60)) = X60,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_8,plain,
! [X47,X48] :
( ~ leq(X47,X48)
| leq(X47,succ(X48)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])]) ).
fof(c_0_9,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> a_select3(q,pv10,X18) = divide(sqrt(times(minus(a_select3(center,X18,n0),a_select2(x,pv10)),minus(a_select3(center,X18,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0013]) ).
fof(c_0_10,plain,
! [X58,X59] :
( ( ~ leq(X58,pred(X59))
| gt(X59,X58) )
& ( ~ gt(X59,X58)
| leq(X58,pred(X59)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])]) ).
cnf(c_0_11,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_13,plain,
( leq(X1,succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
! [X28] :
( leq(n0,pv10)
& leq(pv10,n135299)
& ( ~ leq(n0,X28)
| ~ leq(X28,pred(pv10))
| sum(n0,n4,a_select3(q,X28,tptp_sum_index)) = n1 )
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_15,plain,
( gt(X2,X1)
| ~ leq(X1,pred(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,plain,
! [X34] :
( ~ leq(n0,X34)
| ~ leq(X34,n0)
| X34 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_18,plain,
( leq(X1,n0)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_21,plain,
( gt(n0,X1)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
leq(esk1_0,n0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_25,plain,
! [X76] : ~ gt(X76,X76),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
gt(n0,esk1_0),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV163+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 03:31:29 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.q4hulVM93G/E---3.1_952.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 1048 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.15/0.43 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.15/0.43 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1052 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.15/0.43 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 92
% 0.15/0.43 # Removed by relevancy pruning/SinE : 23
% 0.15/0.43 # Initial clauses : 77
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 77
% 0.15/0.43 # Processed clauses : 169
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 169
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 9
% 0.15/0.43 # Generated clauses : 217
% 0.15/0.43 # ...of the previous two non-redundant : 173
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 217
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 103
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 83
% 0.15/0.43 # Positive orientable unit clauses : 61
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 21
% 0.15/0.43 # Current number of unprocessed clauses: 152
% 0.15/0.43 # ...number of literals in the above : 333
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 86
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 162
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 106
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 32
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 10
% 0.15/0.43 # BW rewrite match successes : 2
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 5689
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.010 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 2072 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.013 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.015 s
% 0.15/0.43 # Maximum resident set size: 1792 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------