TSTP Solution File: NUM482+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n003.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 : Wed Aug 31 18:05:23 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 147 ( 54 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 167 ( 49 ~; 49 |; 56 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 19 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f335,plain,
$false,
inference(avatar_sat_refutation,[],[f249,f330,f332,f334]) ).
fof(f334,plain,
spl8_6,
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f333,plain,
( $false
| spl8_6 ),
inference(resolution,[],[f329,f203]) ).
fof(f203,plain,
isPrime0(xk),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( isPrime0(xk)
& ! [X0] :
( xk = X0
| ~ aNaturalNumber0(X0)
| sz10 = X0
| ( ~ doDivides0(X0,xk)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| sdtasdt0(X0,X1) != xk ) ) )
& ! [X2] :
( ~ aNaturalNumber0(X2)
| ( ~ doDivides0(X2,xk)
& ! [X5] :
( xk != sdtasdt0(X2,X5)
| ~ aNaturalNumber0(X5) ) )
| ( ( sz00 = X2
| sz10 = X2
| ? [X3] :
( ? [X4] :
( sdtasdt0(X3,X4) = X2
& aNaturalNumber0(X4) )
& X2 != X3
& aNaturalNumber0(X3)
& doDivides0(X3,X2)
& sz10 != X3 ) )
& ~ isPrime0(X2) ) ) ),
inference(flattening,[],[f92]) ).
fof(f92,plain,
( ! [X2] :
( ( ~ isPrime0(X2)
& ( sz00 = X2
| ? [X3] :
( X2 != X3
& sz10 != X3
& ? [X4] :
( sdtasdt0(X3,X4) = X2
& aNaturalNumber0(X4) )
& aNaturalNumber0(X3)
& doDivides0(X3,X2) )
| sz10 = X2 ) )
| ~ aNaturalNumber0(X2)
| ( ~ doDivides0(X2,xk)
& ! [X5] :
( xk != sdtasdt0(X2,X5)
| ~ aNaturalNumber0(X5) ) ) )
& ! [X0] :
( xk = X0
| sz10 = X0
| ( ~ doDivides0(X0,xk)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| sdtasdt0(X0,X1) != xk ) )
| ~ aNaturalNumber0(X0) )
& isPrime0(xk) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,plain,
~ ( ( ! [X0] :
( ( ( doDivides0(X0,xk)
| ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(X0,X1) = xk ) )
& aNaturalNumber0(X0) )
=> ( xk = X0
| sz10 = X0 ) )
& isPrime0(xk) )
=> ? [X2] :
( ( isPrime0(X2)
| ( sz00 != X2
& ! [X3] :
( ( ? [X4] :
( sdtasdt0(X3,X4) = X2
& aNaturalNumber0(X4) )
& aNaturalNumber0(X3)
& doDivides0(X3,X2) )
=> ( X2 = X3
| sz10 = X3 ) )
& sz10 != X2 ) )
& aNaturalNumber0(X2)
& ( ? [X5] :
( aNaturalNumber0(X5)
& xk = sdtasdt0(X2,X5) )
| doDivides0(X2,xk) ) ) ),
inference(rectify,[],[f42]) ).
fof(f42,negated_conjecture,
~ ( ( ! [X0] :
( ( ( doDivides0(X0,xk)
| ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(X0,X1) = xk ) )
& aNaturalNumber0(X0) )
=> ( xk = X0
| sz10 = X0 ) )
& isPrime0(xk) )
=> ? [X0] :
( aNaturalNumber0(X0)
& ( ( ! [X1] :
( ( ? [X2] :
( aNaturalNumber0(X2)
& sdtasdt0(X1,X2) = X0 )
& aNaturalNumber0(X1)
& doDivides0(X1,X0) )
=> ( X0 = X1
| sz10 = X1 ) )
& sz00 != X0
& sz10 != X0 )
| isPrime0(X0) )
& ( ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(X0,X1) = xk )
| doDivides0(X0,xk) ) ) ),
inference(negated_conjecture,[],[f41]) ).
fof(f41,conjecture,
( ( ! [X0] :
( ( ( doDivides0(X0,xk)
| ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(X0,X1) = xk ) )
& aNaturalNumber0(X0) )
=> ( xk = X0
| sz10 = X0 ) )
& isPrime0(xk) )
=> ? [X0] :
( aNaturalNumber0(X0)
& ( ( ! [X1] :
( ( ? [X2] :
( aNaturalNumber0(X2)
& sdtasdt0(X1,X2) = X0 )
& aNaturalNumber0(X1)
& doDivides0(X1,X0) )
=> ( X0 = X1
| sz10 = X1 ) )
& sz00 != X0
& sz10 != X0 )
| isPrime0(X0) )
& ( ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(X0,X1) = xk )
| doDivides0(X0,xk) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f329,plain,
( ~ isPrime0(xk)
| spl8_6 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f327,plain,
( spl8_6
<=> isPrime0(xk) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
fof(f332,plain,
spl8_5,
inference(avatar_contradiction_clause,[],[f331]) ).
fof(f331,plain,
( $false
| spl8_5 ),
inference(resolution,[],[f325,f178]) ).
fof(f178,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1716) ).
fof(f325,plain,
( ~ aNaturalNumber0(xk)
| spl8_5 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f323,plain,
( spl8_5
<=> aNaturalNumber0(xk) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
fof(f330,plain,
( ~ spl8_1
| ~ spl8_5
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f318,f327,f323,f241]) ).
fof(f241,plain,
( spl8_1
<=> aNaturalNumber0(sz10) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f318,plain,
( ~ isPrime0(xk)
| ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(sz10) ),
inference(trivial_inequality_removal,[],[f316]) ).
fof(f316,plain,
( ~ isPrime0(xk)
| ~ aNaturalNumber0(sz10)
| xk != xk
| ~ aNaturalNumber0(xk) ),
inference(superposition,[],[f200,f272]) ).
fof(f272,plain,
xk = sdtasdt0(xk,sz10),
inference(resolution,[],[f220,f178]) ).
fof(f220,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0] :
( ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(f200,plain,
! [X2,X5] :
( xk != sdtasdt0(X2,X5)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X5) ),
inference(cnf_transformation,[],[f93]) ).
fof(f249,plain,
spl8_1,
inference(avatar_split_clause,[],[f143,f241]) ).
fof(f143,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
( aNaturalNumber0(sz10)
& sz00 != sz10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 06:41:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48 % (12004)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.52 % (11996)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (12004)First to succeed.
% 0.19/0.53 % (12004)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (12004)------------------------------
% 0.19/0.53 % (12004)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (12004)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (12004)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (12004)Memory used [KB]: 5628
% 0.19/0.53 % (12004)Time elapsed: 0.108 s
% 0.19/0.53 % (12004)Instructions burned: 10 (million)
% 0.19/0.53 % (12004)------------------------------
% 0.19/0.53 % (12004)------------------------------
% 0.19/0.53 % (11992)Success in time 0.176 s
%------------------------------------------------------------------------------