TSTP Solution File: SWV383+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.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 : n005.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:45:24 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 116 ( 47 ~; 29 |; 25 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 84 ( 54 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f239,plain,
$false,
inference(avatar_sat_refutation,[],[f226,f228,f236,f238]) ).
fof(f238,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f237]) ).
fof(f237,plain,
( $false
| ~ spl6_2 ),
inference(resolution,[],[f221,f190]) ).
fof(f190,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& check_cpq(triple(sK5,sK3,sK4))
& ok(triple(sK5,sK3,sK4))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK5,sK3,sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f139,f141,f140]) ).
fof(f140,plain,
( ? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ? [X3,X4,X5] :
( check_cpq(triple(X5,X3,X4))
& ok(triple(X5,X3,X4))
& succ_cpq(triple(X0,X1,X2),triple(X5,X3,X4)) ) )
=> ( ~ check_cpq(triple(sK0,sK1,sK2))
& ? [X5,X4,X3] :
( check_cpq(triple(X5,X3,X4))
& ok(triple(X5,X3,X4))
& succ_cpq(triple(sK0,sK1,sK2),triple(X5,X3,X4)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X5,X4,X3] :
( check_cpq(triple(X5,X3,X4))
& ok(triple(X5,X3,X4))
& succ_cpq(triple(sK0,sK1,sK2),triple(X5,X3,X4)) )
=> ( check_cpq(triple(sK5,sK3,sK4))
& ok(triple(sK5,sK3,sK4))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK5,sK3,sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ? [X3,X4,X5] :
( check_cpq(triple(X5,X3,X4))
& ok(triple(X5,X3,X4))
& succ_cpq(triple(X0,X1,X2),triple(X5,X3,X4)) ) ),
inference(rectify,[],[f91]) ).
fof(f91,plain,
? [X1,X2,X0] :
( ~ check_cpq(triple(X1,X2,X0))
& ? [X4,X3,X5] :
( check_cpq(triple(X5,X4,X3))
& ok(triple(X5,X4,X3))
& succ_cpq(triple(X1,X2,X0),triple(X5,X4,X3)) ) ),
inference(flattening,[],[f90]) ).
fof(f90,plain,
? [X2,X0,X1] :
( ? [X5,X3,X4] :
( check_cpq(triple(X5,X4,X3))
& ok(triple(X5,X4,X3))
& succ_cpq(triple(X1,X2,X0),triple(X5,X4,X3)) )
& ~ check_cpq(triple(X1,X2,X0)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
~ ! [X2,X0,X1] :
( ~ check_cpq(triple(X1,X2,X0))
=> ! [X5,X3,X4] :
( succ_cpq(triple(X1,X2,X0),triple(X5,X4,X3))
=> ( ~ check_cpq(triple(X5,X4,X3))
| ~ ok(triple(X5,X4,X3)) ) ) ),
inference(rectify,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X2,X0,X1] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X5,X4,X3] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X2,X0,X1] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X5,X4,X3] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).
fof(f221,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f219,plain,
( spl6_2
<=> check_cpq(triple(sK0,sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f236,plain,
spl6_3,
inference(avatar_contradiction_clause,[],[f235]) ).
fof(f235,plain,
( $false
| spl6_3 ),
inference(resolution,[],[f225,f189]) ).
fof(f189,plain,
check_cpq(triple(sK5,sK3,sK4)),
inference(cnf_transformation,[],[f142]) ).
fof(f225,plain,
( ~ check_cpq(triple(sK5,sK3,sK4))
| spl6_3 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f223,plain,
( spl6_3
<=> check_cpq(triple(sK5,sK3,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f228,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f227]) ).
fof(f227,plain,
( $false
| spl6_1 ),
inference(resolution,[],[f217,f188]) ).
fof(f188,plain,
ok(triple(sK5,sK3,sK4)),
inference(cnf_transformation,[],[f142]) ).
fof(f217,plain,
( ~ ok(triple(sK5,sK3,sK4))
| spl6_1 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl6_1
<=> ok(triple(sK5,sK3,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f226,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f213,f223,f219,f215]) ).
fof(f213,plain,
( ~ check_cpq(triple(sK5,sK3,sK4))
| check_cpq(triple(sK0,sK1,sK2))
| ~ ok(triple(sK5,sK3,sK4)) ),
inference(resolution,[],[f203,f187]) ).
fof(f187,plain,
succ_cpq(triple(sK0,sK1,sK2),triple(sK5,sK3,sK4)),
inference(cnf_transformation,[],[f142]) ).
fof(f203,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ succ_cpq(triple(X2,X0,X1),triple(X5,X3,X4))
| ~ ok(triple(X5,X3,X4))
| check_cpq(triple(X2,X0,X1))
| ~ check_cpq(triple(X5,X3,X4)) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X5,X3,X4))
| ~ succ_cpq(triple(X2,X0,X1),triple(X5,X3,X4))
| ~ check_cpq(triple(X5,X3,X4)) )
| ( ok(triple(X2,X0,X1))
& check_cpq(triple(X2,X0,X1)) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
! [X1,X2,X0] :
( ! [X5,X3,X4] :
( ~ ok(triple(X4,X5,X3))
| ~ succ_cpq(triple(X0,X1,X2),triple(X4,X5,X3))
| ~ check_cpq(triple(X4,X5,X3)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ! [X5,X3,X4] :
( ~ check_cpq(triple(X4,X5,X3))
| ~ ok(triple(X4,X5,X3))
| ~ succ_cpq(triple(X0,X1,X2),triple(X4,X5,X3)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X5,X3,X4] :
( succ_cpq(triple(X0,X1,X2),triple(X4,X5,X3))
=> ( ~ check_cpq(triple(X4,X5,X3))
| ~ ok(triple(X4,X5,X3)) ) ) ),
inference(rectify,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X5,X3,X4] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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 : n005.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:21:03 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (3289)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.21/0.51 % (3281)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.21/0.51 % (3275)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.51 % (3270)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (3274)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.21/0.51 % (3271)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.51 % (3281)Instruction limit reached!
% 0.21/0.51 % (3281)------------------------------
% 0.21/0.51 % (3281)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (3281)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (3281)Termination reason: Unknown
% 0.21/0.51 % (3281)Termination phase: Equality resolution with deletion
% 0.21/0.51
% 0.21/0.51 % (3281)Memory used [KB]: 1535
% 0.21/0.51 % (3281)Time elapsed: 0.005 s
% 0.21/0.51 % (3281)Instructions burned: 3 (million)
% 0.21/0.51 % (3281)------------------------------
% 0.21/0.51 % (3281)------------------------------
% 0.21/0.52 % (3289)First to succeed.
% 0.21/0.52 % (3273)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.21/0.52 % (3289)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (3289)------------------------------
% 0.21/0.52 % (3289)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (3289)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (3289)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (3289)Memory used [KB]: 6012
% 0.21/0.52 % (3289)Time elapsed: 0.063 s
% 0.21/0.52 % (3289)Instructions burned: 4 (million)
% 0.21/0.52 % (3289)------------------------------
% 0.21/0.52 % (3289)------------------------------
% 0.21/0.52 % (3266)Success in time 0.165 s
%------------------------------------------------------------------------------