TSTP Solution File: SWV488+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n020.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:50:12 EDT 2022
% Result : Theorem 0.22s 0.54s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 205 ( 62 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 250 ( 87 ~; 78 |; 62 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 71 ( 63 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f286,plain,
$false,
inference(avatar_sat_refutation,[],[f85,f222,f284]) ).
fof(f284,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f283]) ).
fof(f283,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f282,f50]) ).
fof(f50,plain,
real_zero != real_one,
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants) ).
fof(f282,plain,
( real_zero = real_one
| ~ spl3_1 ),
inference(backward_demodulation,[],[f72,f267]) ).
fof(f267,plain,
( real_one = a(sK0,sK0)
| ~ spl3_1 ),
inference(unit_resulting_resolution,[],[f71,f74,f71,f57,f81]) ).
fof(f81,plain,
( ! [X0,X6] :
( ~ int_leq(int_one,X6)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X6,X0)
| real_one = a(X6,X6) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl3_1
<=> ! [X6,X0] :
( ~ int_leq(int_one,X6)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| real_one = a(X6,X6)
| ~ int_leq(X6,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f57,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
( sK1 = sK0
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& real_zero = a(sK0,sK1)
& int_leq(sK1,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f36,f37]) ).
fof(f37,plain,
( ? [X0,X1] :
( X0 = X1
& int_leq(int_one,X1)
& int_leq(X0,n)
& real_zero = a(X0,X1)
& int_leq(X1,X0) )
=> ( sK1 = sK0
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& real_zero = a(sK0,sK1)
& int_leq(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
? [X0,X1] :
( X0 = X1
& int_leq(int_one,X1)
& int_leq(X0,n)
& real_zero = a(X0,X1)
& int_leq(X1,X0) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
? [X1,X0] :
( X0 = X1
& int_leq(int_one,X0)
& int_leq(X1,n)
& real_zero = a(X1,X0)
& int_leq(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
? [X0,X1] :
( real_zero = a(X1,X0)
& X0 = X1
& int_leq(int_one,X0)
& int_leq(X0,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,X1)
& 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(X1,X0)
& int_leq(int_one,X1) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X1,X0] :
( ( int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uti) ).
fof(f74,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X1,X0] :
( ( int_leq(X1,X0)
| ( X0 != X1
& ~ int_less(X1,X0) ) )
& ( X0 = X1
| int_less(X1,X0)
| ~ int_leq(X1,X0) ) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X1,X0] :
( ( int_leq(X1,X0)
| ( X0 != X1
& ~ int_less(X1,X0) ) )
& ( X0 = X1
| int_less(X1,X0)
| ~ int_leq(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( int_leq(X1,X0)
<=> ( X0 = X1
| int_less(X1,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(f71,plain,
int_leq(int_one,sK0),
inference(definition_unfolding,[],[f58,f59]) ).
fof(f59,plain,
sK1 = sK0,
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f72,plain,
real_zero = a(sK0,sK0),
inference(definition_unfolding,[],[f56,f59]) ).
fof(f56,plain,
real_zero = a(sK0,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f222,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f221]) ).
fof(f221,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f217,f71]) ).
fof(f217,plain,
( ~ int_leq(int_one,sK0)
| ~ spl3_2 ),
inference(unit_resulting_resolution,[],[f57,f84]) ).
fof(f84,plain,
( ! [X1] :
( ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f83,plain,
( spl3_2
<=> ! [X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f85,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f51,f83,f80]) ).
fof(f51,plain,
! [X0,X1,X6] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| real_one = a(X6,X6)
| ~ int_leq(int_one,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ int_leq(int_one,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ( ! [X2] :
( ! [X3] :
( ~ int_leq(X3,X0)
| real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3) )
| ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
& ! [X4] :
( ~ int_less(int_zero,X4)
| plus(X1,X4) != X0
| ! [X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5) ) )
& ! [X6] :
( real_one = a(X6,X6)
| ~ int_leq(X6,X0)
| ~ int_leq(int_one,X6) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X0] :
( ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ( ! [X5] :
( ! [X6] :
( ~ int_leq(X6,X1)
| real_zero = a(plus(X6,X5),X6)
| ~ int_leq(int_one,X6) )
| ~ int_less(int_zero,X5)
| plus(X1,X5) != X0 )
& ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1
| ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) ) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) ) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X1) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) )
& ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X0) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X1,n)
& int_leq(X0,n)
& int_leq(int_one,X1) )
=> ( ! [X5] :
( ( plus(X1,X5) = X0
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(int_one,X6)
& int_leq(X6,X1) )
=> real_zero = a(plus(X6,X5),X6) ) )
& ! [X2] :
( ( plus(X0,X2) = X1
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> real_zero = a(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> real_one = a(X4,X4) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X1,n)
& int_leq(X0,n)
& int_leq(int_one,X1) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> real_zero = a(X2,plus(X2,X7)) ) )
& ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_one = a(X2,X2) )
& ! [X7] :
( ( int_less(int_zero,X7)
& plus(X1,X7) = X0 )
=> ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X1) )
=> real_zero = a(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qii) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 19:34:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.51 % (20837)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.52 % (20845)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.22/0.52 % (20829)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.22/0.52 % (20838)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.52 % (20830)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.22/0.53 % (20846)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.22/0.53 % (20828)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.22/0.53 % (20830)First to succeed.
% 0.22/0.53 % (20837)Instruction limit reached!
% 0.22/0.53 % (20837)------------------------------
% 0.22/0.53 % (20837)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.53 % (20837)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.53 % (20837)Termination reason: Unknown
% 0.22/0.53 % (20837)Termination phase: Saturation
% 0.22/0.53
% 0.22/0.53 % (20837)Memory used [KB]: 5884
% 0.22/0.53 % (20837)Time elapsed: 0.004 s
% 0.22/0.53 % (20837)Instructions burned: 3 (million)
% 0.22/0.53 % (20837)------------------------------
% 0.22/0.53 % (20837)------------------------------
% 0.22/0.53 % (20839)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.53 % (20852)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.22/0.54 % (20823)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.22/0.54 % (20850)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.22/0.54 % (20833)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.22/0.54 % (20847)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.54 % (20844)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.54 % (20838)Instruction limit reached!
% 0.22/0.54 % (20838)------------------------------
% 0.22/0.54 % (20838)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.54 % (20838)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.54 % (20838)Termination reason: Unknown
% 0.22/0.54 % (20838)Termination phase: Saturation
% 0.22/0.54
% 0.22/0.54 % (20838)Memory used [KB]: 6012
% 0.22/0.54 % (20838)Time elapsed: 0.128 s
% 0.22/0.54 % (20838)Instructions burned: 7 (million)
% 0.22/0.54 % (20838)------------------------------
% 0.22/0.54 % (20838)------------------------------
% 0.22/0.54 % (20843)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.22/0.54 % (20836)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.54 % (20851)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.22/0.54 % (20830)Refutation found. Thanks to Tanya!
% 0.22/0.54 % SZS status Theorem for theBenchmark
% 0.22/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.55 % (20830)------------------------------
% 0.22/0.55 % (20830)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.55 % (20830)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.55 % (20830)Termination reason: Refutation
% 0.22/0.55
% 0.22/0.55 % (20830)Memory used [KB]: 6012
% 0.22/0.55 % (20830)Time elapsed: 0.107 s
% 0.22/0.55 % (20830)Instructions burned: 8 (million)
% 0.22/0.55 % (20830)------------------------------
% 0.22/0.55 % (20830)------------------------------
% 0.22/0.55 % (20822)Success in time 0.183 s
%------------------------------------------------------------------------------