TSTP Solution File: SWC103+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC103+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 : n002.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:38:49 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 83 ( 18 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 94 ( 31 ~; 26 |; 26 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f223,plain,
$false,
inference(avatar_sat_refutation,[],[f215,f216,f221,f222]) ).
fof(f222,plain,
( spl9_5
| ~ spl9_3 ),
inference(avatar_split_clause,[],[f185,f208,f218]) ).
fof(f218,plain,
( spl9_5
<=> neq(sK0,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f208,plain,
( spl9_3
<=> neq(sK1,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f185,plain,
( ~ neq(sK1,nil)
| neq(sK0,nil) ),
inference(definition_unfolding,[],[f153,f159,f157]) ).
fof(f157,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& ssList(X3)
& ( ( neq(X2,nil)
& frontsegP(X3,X2) )
| ~ neq(X3,nil) ) ) ) )
& ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( ( neq(X2,nil)
& frontsegP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& 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)
=> ( ~ neq(X1,nil)
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) )
| ( nil != X2
& nil = X3 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) )
| ( nil != X2
& nil = X3 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f159,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f111]) ).
fof(f153,plain,
( ~ neq(sK3,nil)
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f111]) ).
fof(f221,plain,
( ~ spl9_5
| ~ spl9_4 ),
inference(avatar_split_clause,[],[f154,f212,f218]) ).
fof(f212,plain,
( spl9_4
<=> frontsegP(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f154,plain,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f111]) ).
fof(f216,plain,
spl9_3,
inference(avatar_split_clause,[],[f158,f208]) ).
fof(f158,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f111]) ).
fof(f215,plain,
( ~ spl9_3
| spl9_4 ),
inference(avatar_split_clause,[],[f186,f212,f208]) ).
fof(f186,plain,
( frontsegP(sK1,sK0)
| ~ neq(sK1,nil) ),
inference(definition_unfolding,[],[f152,f159,f159,f157]) ).
fof(f152,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC103+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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.12/0.34 % Computer : n002.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 18:30:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 % (29285)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.19/0.45 % (29277)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.19/0.46 % (29285)First to succeed.
% 0.19/0.46 % (29285)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (29285)------------------------------
% 0.19/0.46 % (29285)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (29285)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (29285)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (29285)Memory used [KB]: 6140
% 0.19/0.46 % (29285)Time elapsed: 0.005 s
% 0.19/0.46 % (29285)Instructions burned: 4 (million)
% 0.19/0.46 % (29285)------------------------------
% 0.19/0.46 % (29285)------------------------------
% 0.19/0.46 % (29274)Success in time 0.121 s
%------------------------------------------------------------------------------