TSTP Solution File: SWC365+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.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 : 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:40:44 EDT 2022
% Result : Theorem 0.13s 0.47s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 174 ( 54 equ)
% Maximal formula atoms : 26 ( 8 avg)
% Number of connectives : 204 ( 51 ~; 37 |; 102 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f252,plain,
$false,
inference(avatar_sat_refutation,[],[f230,f245,f251]) ).
fof(f251,plain,
~ spl9_7,
inference(avatar_split_clause,[],[f185,f242]) ).
fof(f242,plain,
( spl9_7
<=> rearsegP(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_7])]) ).
fof(f185,plain,
~ rearsegP(sK4,sK3),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ssList(sK3)
& ssList(sK4)
& ssList(sK5)
& ( ~ neq(sK6,nil)
| ( rearsegP(sK6,sK5)
& neq(sK5,nil) ) )
& ( nil = sK5
| nil != sK6 )
& sK6 = sK4
& ~ rearsegP(sK4,sK3)
& sK5 = sK3
& neq(sK4,nil)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f107,f144,f143,f142,f141]) ).
fof(f141,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& X1 = X3
& ~ rearsegP(X1,X0)
& X0 = X2
& neq(X1,nil)
& ssList(X3) ) ) ) )
=> ( ssList(sK3)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& X1 = X3
& ~ rearsegP(X1,sK3)
& sK3 = X2
& neq(X1,nil)
& ssList(X3) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& X1 = X3
& ~ rearsegP(X1,sK3)
& sK3 = X2
& neq(X1,nil)
& ssList(X3) ) ) )
=> ( ssList(sK4)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& sK4 = X3
& ~ rearsegP(sK4,sK3)
& sK3 = X2
& neq(sK4,nil)
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& sK4 = X3
& ~ rearsegP(sK4,sK3)
& sK3 = X2
& neq(sK4,nil)
& ssList(X3) ) )
=> ( ssList(sK5)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,sK5)
& neq(sK5,nil) ) )
& ( nil = sK5
| nil != X3 )
& sK4 = X3
& ~ rearsegP(sK4,sK3)
& sK5 = sK3
& neq(sK4,nil)
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,sK5)
& neq(sK5,nil) ) )
& ( nil = sK5
| nil != X3 )
& sK4 = X3
& ~ rearsegP(sK4,sK3)
& sK5 = sK3
& neq(sK4,nil)
& ssList(X3) )
=> ( ( ~ neq(sK6,nil)
| ( rearsegP(sK6,sK5)
& neq(sK5,nil) ) )
& ( nil = sK5
| nil != sK6 )
& sK6 = sK4
& ~ rearsegP(sK4,sK3)
& sK5 = sK3
& neq(sK4,nil)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& ( nil = X2
| nil != X3 )
& X1 = X3
& ~ rearsegP(X1,X0)
& X0 = X2
& neq(X1,nil)
& ssList(X3) ) ) ) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ rearsegP(X1,X0)
& neq(X1,nil)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( rearsegP(X3,X2)
& neq(X2,nil) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f245,plain,
( ~ spl9_4
| spl9_7 ),
inference(avatar_split_clause,[],[f199,f242,f226]) ).
fof(f226,plain,
( spl9_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f199,plain,
( rearsegP(sK4,sK3)
| ~ neq(sK4,nil) ),
inference(definition_unfolding,[],[f189,f186,f186,f184]) ).
fof(f184,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f145]) ).
fof(f186,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f145]) ).
fof(f189,plain,
( ~ neq(sK6,nil)
| rearsegP(sK6,sK5) ),
inference(cnf_transformation,[],[f145]) ).
fof(f230,plain,
spl9_4,
inference(avatar_split_clause,[],[f183,f226]) ).
fof(f183,plain,
neq(sK4,nil),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Aug 30 19:03:25 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.45 % (17970)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.13/0.45 % (17987)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.13/0.46 % (17979)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.13/0.46 % (17978)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.13/0.46 % (17970)First to succeed.
% 0.13/0.46 % (17986)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.13/0.47 % (17970)Refutation found. Thanks to Tanya!
% 0.13/0.47 % SZS status Theorem for theBenchmark
% 0.13/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.47 % (17970)------------------------------
% 0.13/0.47 % (17970)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.13/0.47 % (17970)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.13/0.47 % (17970)Termination reason: Refutation
% 0.13/0.47
% 0.13/0.47 % (17970)Memory used [KB]: 6012
% 0.13/0.47 % (17970)Time elapsed: 0.111 s
% 0.13/0.47 % (17970)Instructions burned: 4 (million)
% 0.13/0.47 % (17970)------------------------------
% 0.13/0.47 % (17970)------------------------------
% 0.13/0.47 % (17963)Success in time 0.168 s
%------------------------------------------------------------------------------