TSTP Solution File: SWV050+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV050+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:00 EDT 2022
% Result : Theorem 0.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 21 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 22 ( 8 ~; 4 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 15 con; 0-3 aty)
% Number of variables : 13 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0022,conjecture,
( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
& pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
=> ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
& pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
& pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_norm_0022) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
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(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(c_0_6,negated_conjecture,
~ ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
& pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
=> ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
& pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
& pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0022]) ).
fof(c_0_7,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_8,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_9,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_10,negated_conjecture,
( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
& pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))
& ( n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
| pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
| pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
minus(X1,n1) = pred(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,negated_conjecture,
( pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))
| pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
| n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_19,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
fof(c_0_20,plain,
! [X24] : sum(n0,tptp_minus_1,X24) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_21,negated_conjecture,
sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.14 % Problem : SWV050+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.15/0.14 % Command : run_ET %s %d
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Tue Jun 14 17:36:44 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45 # Preprocessing time : 0.019 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 25
% 0.28/1.45 # Proof object clause steps : 13
% 0.28/1.45 # Proof object formula steps : 12
% 0.28/1.45 # Proof object conjectures : 8
% 0.28/1.45 # Proof object clause conjectures : 5
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 8
% 0.28/1.45 # Proof object initial formulas used : 6
% 0.28/1.45 # Proof object generating inferences : 1
% 0.28/1.45 # Proof object simplifying inferences : 9
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 85
% 0.28/1.45 # Removed by relevancy pruning/SinE : 23
% 0.28/1.45 # Initial clauses : 67
% 0.28/1.45 # Removed in clause preprocessing : 2
% 0.28/1.45 # Initial clauses in saturation : 65
% 0.28/1.45 # Processed clauses : 70
% 0.28/1.45 # ...of these trivial : 1
% 0.28/1.45 # ...subsumed : 0
% 0.28/1.45 # ...remaining for further processing : 69
% 0.28/1.45 # Other redundant clauses eliminated : 0
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 0
% 0.28/1.45 # Backward-rewritten : 4
% 0.28/1.45 # Generated clauses : 187
% 0.28/1.45 # ...of the previous two non-trivial : 152
% 0.28/1.45 # Contextual simplify-reflections : 0
% 0.28/1.45 # Paramodulations : 185
% 0.28/1.45 # Factorizations : 2
% 0.28/1.45 # Equation resolutions : 0
% 0.28/1.45 # Current number of processed clauses : 65
% 0.28/1.45 # Positive orientable unit clauses : 39
% 0.28/1.45 # Positive unorientable unit clauses: 4
% 0.28/1.45 # Negative unit clauses : 1
% 0.28/1.45 # Non-unit-clauses : 21
% 0.28/1.45 # Current number of unprocessed clauses: 143
% 0.28/1.45 # ...number of literals in the above : 318
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 6
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 33
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 11
% 0.28/1.45 # Non-unit clause-clause subsumptions : 0
% 0.28/1.45 # Unit Clause-clause subsumption calls : 38
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 17
% 0.28/1.45 # BW rewrite match successes : 16
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 5615
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.021 s
% 0.28/1.45 # System time : 0.004 s
% 0.28/1.45 # Total time : 0.025 s
% 0.28/1.45 # Maximum resident set size: 3196 pages
%------------------------------------------------------------------------------