TSTP Solution File: SWV050+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV050+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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 : 300s
% DateTime : Tue Apr 30 20:45:51 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 64 ( 40 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 48 ( 18 ~; 17 |; 8 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 15 con; 0-3 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [Body] : sum(n0,tptp_minus_1,Body) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f40,axiom,
! [X] : pred(succ(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,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/benchmark/theBenchmark.p') ).
fof(f54,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(negated_conjecture,[status(cth)],[f53]) ).
fof(f197,plain,
! [X0] : sum(n0,tptp_minus_1,X0) = n0,
inference(cnf_transformation,[status(esa)],[f26]) ).
fof(f199,plain,
succ(tptp_minus_1) = n0,
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f210,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f211,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f244,plain,
( 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(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
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(cnf_transformation,[status(esa)],[f244]) ).
fof(f246,plain,
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(cnf_transformation,[status(esa)],[f244]) ).
fof(f247,plain,
( 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(cnf_transformation,[status(esa)],[f244]) ).
fof(f313,plain,
( spl0_0
<=> 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))))) ),
introduced(split_symbol_definition) ).
fof(f315,plain,
( 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)))))
| spl0_0 ),
inference(component_clause,[status(thm)],[f313]) ).
fof(f316,plain,
( spl0_1
<=> 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))))) ),
introduced(split_symbol_definition) ).
fof(f318,plain,
( 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)))))
| spl0_1 ),
inference(component_clause,[status(thm)],[f316]) ).
fof(f319,plain,
( spl0_2
<=> 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))))) ),
introduced(split_symbol_definition) ).
fof(f321,plain,
( 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)))))
| spl0_2 ),
inference(component_clause,[status(thm)],[f319]) ).
fof(f322,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f247,f313,f316,f319]) ).
fof(f382,plain,
pred(n0) = tptp_minus_1,
inference(paramodulation,[status(thm)],[f199,f211]) ).
fof(f409,plain,
( pv88 != pv88
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f246,f321]) ).
fof(f410,plain,
( $false
| spl0_2 ),
inference(trivial_equality_resolution,[status(esa)],[f409]) ).
fof(f411,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f410]) ).
fof(f601,plain,
( pv86 != pv86
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f245,f318]) ).
fof(f602,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f601]) ).
fof(f603,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f602]) ).
fof(f1112,plain,
( n0 != sum(n0,pred(n0),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
| spl0_0 ),
inference(backward_demodulation,[status(thm)],[f210,f315]) ).
fof(f1113,plain,
( n0 != sum(n0,tptp_minus_1,divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f382,f1112]) ).
fof(f1114,plain,
( n0 != n0
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f197,f1113]) ).
fof(f1115,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f1114]) ).
fof(f1116,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f1115]) ).
fof(f1117,plain,
$false,
inference(sat_refutation,[status(thm)],[f322,f411,f603,f1116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV050+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33 % Computer : n014.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Tue Apr 30 00:28:34 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.10/0.34 % Drodi V3.6.0
% 0.15/0.38 % Refutation found
% 0.15/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.40 % Elapsed time: 0.066660 seconds
% 0.15/0.40 % CPU time: 0.348355 seconds
% 0.15/0.40 % Total memory used: 67.770 MB
% 0.15/0.40 % Net memory used: 67.394 MB
%------------------------------------------------------------------------------