TSTP Solution File: SWV055+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:15:01 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 24 unt; 0 def)
% Number of atoms : 153 ( 32 equ)
% Maximal formula atoms : 41 ( 3 avg)
% Number of connectives : 163 ( 59 ~; 65 |; 29 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 13 con; 0-3 aty)
% Number of variables : 50 ( 3 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0037,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(X4,minus(n0,n1)) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(X21,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_norm_0037) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
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(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_8,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(X4,minus(n0,n1)) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(X21,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0037]) ).
fof(c_0_9,negated_conjecture,
! [X23,X24] :
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( ~ leq(n0,X23)
| ~ leq(X23,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X23,X24)) = n1 )
& ( leq(n0,esk3_0)
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk3_0)
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk3_0)
| 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,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| 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,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| 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,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
fof(c_0_10,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_11,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_12,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_13,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| leq(n0,esk3_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| leq(esk3_0,minus(pv10,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_22,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])])]) ).
cnf(c_0_23,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_24,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14]),c_0_15])]) ).
cnf(c_0_26,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,minus(n0,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14]),c_0_15])]) ).
cnf(c_0_27,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_28,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_29,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
cnf(c_0_31,negated_conjecture,
leq(esk1_0,minus(n0,n1)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( leq(n0,esk1_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( leq(n0,esk1_0)
| leq(n0,esk3_0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,minus(pv10,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_36,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_37,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_38,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( leq(n0,esk1_0)
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_14]),c_0_15])]) ).
cnf(c_0_41,negated_conjecture,
( leq(n0,esk3_0)
| leq(n0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_14]),c_0_15])]) ).
cnf(c_0_42,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(n0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_14]),c_0_15])]) ).
cnf(c_0_43,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( gt(n0,X1)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_45,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
leq(n0,esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 10:14:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.022 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 49
% 0.26/1.43 # Proof object clause steps : 33
% 0.26/1.43 # Proof object formula steps : 16
% 0.26/1.43 # Proof object conjectures : 23
% 0.26/1.43 # Proof object clause conjectures : 20
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 16
% 0.26/1.43 # Proof object initial formulas used : 8
% 0.26/1.43 # Proof object generating inferences : 7
% 0.26/1.43 # Proof object simplifying inferences : 28
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 92
% 0.26/1.43 # Removed by relevancy pruning/SinE : 23
% 0.26/1.43 # Initial clauses : 83
% 0.26/1.43 # Removed in clause preprocessing : 2
% 0.26/1.43 # Initial clauses in saturation : 81
% 0.26/1.43 # Processed clauses : 487
% 0.26/1.43 # ...of these trivial : 50
% 0.26/1.43 # ...subsumed : 103
% 0.26/1.43 # ...remaining for further processing : 334
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 3
% 0.26/1.43 # Backward-rewritten : 13
% 0.26/1.43 # Generated clauses : 1773
% 0.26/1.43 # ...of the previous two non-trivial : 1209
% 0.26/1.43 # Contextual simplify-reflections : 22
% 0.26/1.43 # Paramodulations : 1769
% 0.26/1.43 # Factorizations : 4
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 318
% 0.26/1.43 # Positive orientable unit clauses : 128
% 0.26/1.43 # Positive unorientable unit clauses: 5
% 0.26/1.43 # Negative unit clauses : 46
% 0.26/1.43 # Non-unit-clauses : 139
% 0.26/1.43 # Current number of unprocessed clauses: 789
% 0.26/1.43 # ...number of literals in the above : 1945
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 18
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 1310
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 1244
% 0.26/1.43 # Non-unit clause-clause subsumptions : 54
% 0.26/1.43 # Unit Clause-clause subsumption calls : 1178
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 32
% 0.26/1.43 # BW rewrite match successes : 23
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 19215
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.084 s
% 0.26/1.43 # System time : 0.007 s
% 0.26/1.43 # Total time : 0.091 s
% 0.26/1.43 # Maximum resident set size: 4532 pages
%------------------------------------------------------------------------------