TSTP Solution File: SWV488+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV488+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 : 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 : 300s
% DateTime : Wed Aug 31 18:59:20 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 12 unt; 0 def)
% Number of atoms : 220 ( 62 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 277 ( 102 ~; 90 |; 62 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 74 ( 66 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f113,plain,
$false,
inference(avatar_sat_refutation,[],[f82,f86,f111]) ).
fof(f111,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f110]) ).
fof(f110,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f109,f70]) ).
fof(f70,plain,
int_leq(int_one,sK0),
inference(definition_unfolding,[],[f45,f48]) ).
fof(f48,plain,
sK1 = sK0,
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( int_leq(sK1,sK0)
& sK1 = sK0
& int_leq(sK0,n)
& real_zero = a(sK0,sK1)
& int_leq(int_one,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f29,f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( int_leq(X1,X0)
& X0 = X1
& int_leq(X0,n)
& real_zero = a(X0,X1)
& int_leq(int_one,X1) )
=> ( int_leq(sK1,sK0)
& sK1 = sK0
& int_leq(sK0,n)
& real_zero = a(sK0,sK1)
& int_leq(int_one,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0,X1] :
( int_leq(X1,X0)
& X0 = X1
& int_leq(X0,n)
& real_zero = a(X0,X1)
& int_leq(int_one,X1) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
? [X1,X0] :
( int_leq(X0,X1)
& X0 = X1
& int_leq(X1,n)
& real_zero = a(X1,X0)
& int_leq(int_one,X0) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
? [X0,X1] :
( real_zero = a(X1,X0)
& X0 = X1
& int_leq(X0,X1)
& int_leq(int_one,X0)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X0,X1] :
( ( int_leq(X0,X1)
& int_leq(int_one,X0)
& int_leq(X1,n) )
=> ( X0 = X1
=> real_zero != a(X1,X0) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X1,X0] :
( ( int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,X0) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X1,X0] :
( ( int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,X0) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uti) ).
fof(f45,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f109,plain,
( ~ int_leq(int_one,sK0)
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f105,f47]) ).
fof(f47,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f31]) ).
fof(f105,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ spl3_1 ),
inference(resolution,[],[f97,f72]) ).
fof(f72,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) )
& ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( ( int_less(X1,X0)
| X0 = X1
| ~ int_leq(X1,X0) )
& ( int_leq(X1,X0)
| ( ~ int_less(X1,X0)
& X0 != X1 ) ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X1,X0] :
( ( int_less(X1,X0)
| X0 = X1
| ~ int_leq(X1,X0) )
& ( int_leq(X1,X0)
| ( ~ int_less(X1,X0)
& X0 != X1 ) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ( int_less(X1,X0)
| X0 = X1 )
<=> int_leq(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( int_leq(X0,X1)
<=> ( int_less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(f97,plain,
( ! [X0] :
( ~ int_leq(sK0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) )
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f96,f50]) ).
fof(f50,plain,
real_zero != real_one,
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
real_zero != real_one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_constants) ).
fof(f96,plain,
( ! [X0] :
( real_zero = real_one
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(sK0,X0) )
| ~ spl3_1 ),
inference(forward_demodulation,[],[f93,f69]) ).
fof(f69,plain,
real_zero = a(sK0,sK0),
inference(definition_unfolding,[],[f46,f48]) ).
fof(f46,plain,
real_zero = a(sK0,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f93,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(sK0,X0)
| real_one = a(sK0,sK0)
| ~ int_leq(X0,n) )
| ~ spl3_1 ),
inference(resolution,[],[f78,f70]) ).
fof(f78,plain,
( ! [X2,X0] :
( ~ int_leq(int_one,X2)
| real_one = a(X2,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f77,plain,
( spl3_1
<=> ! [X2,X0] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(int_one,X2)
| real_one = a(X2,X2)
| ~ int_leq(X2,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f86,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f85,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f83,f47]) ).
fof(f83,plain,
( ~ int_leq(sK0,n)
| ~ spl3_2 ),
inference(resolution,[],[f81,f70]) ).
fof(f81,plain,
( ! [X1] :
( ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl3_2
<=> ! [X1] :
( ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f82,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f66,f80,f77]) ).
fof(f66,plain,
! [X2,X0,X1] :
( ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0)
| real_one = a(X2,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ( ! [X2] :
( ~ int_leq(X2,X0)
| ~ int_leq(int_one,X2)
| real_one = a(X2,X2) )
& ! [X3] :
( ! [X4] :
( ~ int_leq(int_one,X4)
| ~ int_leq(X4,X0)
| real_zero = a(plus(X4,X3),X4) )
| ~ int_less(int_zero,X3)
| plus(X0,X3) != X1 )
& ! [X5] :
( plus(X1,X5) != X0
| ! [X6] :
( ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) )
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ~ int_leq(X0,n)
| ( ! [X4] :
( ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| real_one = a(X4,X4) )
& ! [X2] :
( ! [X3] :
( ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| real_zero = a(plus(X3,X2),X3) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X5] :
( plus(X0,X5) != X1
| ! [X6] :
( ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6)
| real_zero = a(X6,plus(X6,X5)) )
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(int_one,X0)
& int_leq(X0,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& plus(X1,X2) = X0 )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> real_zero = a(plus(X3,X2),X3) ) )
& ! [X5] :
( ( int_less(int_zero,X5)
& plus(X0,X5) = X1 )
=> ! [X6] :
( ( int_leq(int_one,X6)
& int_leq(X6,X0) )
=> real_zero = a(X6,plus(X6,X5)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(int_one,X0)
& int_leq(X0,n) )
=> ( ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X1) )
=> real_zero = a(plus(X2,X7),X2) ) )
& ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X1) )
=> real_one = a(X2,X2) )
& ! [X7] :
( ( int_less(int_zero,X7)
& plus(X0,X7) = X1 )
=> ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X0) )
=> real_zero = a(X2,plus(X2,X7)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qii) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % 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.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 19:33:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (26140)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.49 % (26160)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.49 % (26147)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (26160)First to succeed.
% 0.19/0.50 % (26152)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.50 % (26148)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50 % (26163)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.50 % (26148)Instruction limit reached!
% 0.19/0.50 % (26148)------------------------------
% 0.19/0.50 % (26148)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (26148)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (26148)Termination reason: Unknown
% 0.19/0.50 % (26148)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (26148)Memory used [KB]: 5373
% 0.19/0.50 % (26148)Time elapsed: 0.118 s
% 0.19/0.50 % (26148)Instructions burned: 3 (million)
% 0.19/0.50 % (26148)------------------------------
% 0.19/0.50 % (26148)------------------------------
% 0.19/0.50 % (26168)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.51 % (26162)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.51 % (26141)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (26162)Also succeeded, but the first one will report.
% 0.19/0.51 % (26160)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (26160)------------------------------
% 0.19/0.51 % (26160)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (26160)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (26160)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (26160)Memory used [KB]: 5500
% 0.19/0.51 % (26160)Time elapsed: 0.106 s
% 0.19/0.51 % (26160)Instructions burned: 4 (million)
% 0.19/0.51 % (26160)------------------------------
% 0.19/0.51 % (26160)------------------------------
% 0.19/0.51 % (26139)Success in time 0.167 s
%------------------------------------------------------------------------------