TSTP Solution File: SWC116+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC116+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 : n017.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:55 EDT 2022
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 7 unt; 0 def)
% Number of atoms : 271 ( 96 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 339 ( 115 ~; 95 |; 107 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f274,plain,
$false,
inference(avatar_sat_refutation,[],[f222,f227,f236,f251,f252,f253,f273]) ).
fof(f273,plain,
( spl10_3
| spl10_4
| ~ spl10_6 ),
inference(avatar_contradiction_clause,[],[f272]) ).
fof(f272,plain,
( $false
| spl10_3
| spl10_4
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f271,f174]) ).
fof(f174,plain,
ssList(sK3),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
( ssList(sK2)
& ssList(sK4)
& ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK5 = sK3
& ssList(sK5)
& ( ( neq(sK4,nil)
& segmentP(sK5,sK4) )
| ~ neq(sK5,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != sK5
| nil = sK4 )
& sK4 = sK2
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f118,f139,f138,f137,f136]) ).
fof(f136,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& X1 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != X0 )
& ( nil != X3
| nil = X2 )
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK2)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(X1,sK2)
| ~ neq(sK2,nil) )
& X1 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != sK2 )
& ( nil != X3
| nil = X2 )
& sK2 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(X1,sK2)
| ~ neq(sK2,nil) )
& X1 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != sK2 )
& ( nil != X3
| nil = X2 )
& sK2 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK3 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != X3
| nil = X2 )
& sK2 = X2 ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK3 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != X3
| nil = X2 )
& sK2 = X2 ) )
=> ( ssList(sK4)
& ? [X3] :
( ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK3 = X3
& ssList(X3)
& ( ( neq(sK4,nil)
& segmentP(X3,sK4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != X3
| nil = sK4 )
& sK4 = sK2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X3] :
( ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK3 = X3
& ssList(X3)
& ( ( neq(sK4,nil)
& segmentP(X3,sK4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != X3
| nil = sK4 )
& sK4 = sK2 )
=> ( ( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) )
& sK5 = sK3
& ssList(sK5)
& ( ( neq(sK4,nil)
& segmentP(sK5,sK4) )
| ~ neq(sK5,nil) )
& ( nil != sK3
| nil != sK2 )
& ( nil != sK5
| nil = sK4 )
& sK4 = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& X1 = X3
& ssList(X3)
& ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != X0 )
& ( nil != X3
| nil = X2 )
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f117]) ).
fof(f117,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( neq(X2,nil)
& segmentP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X1
| nil != X0 )
& 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(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( nil = X1
& nil = X0 )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( nil = X1
& nil = X0 )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f271,plain,
( ~ ssList(sK3)
| spl10_3
| spl10_4
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f270,f231]) ).
fof(f231,plain,
( nil != sK3
| spl10_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl10_4
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f270,plain,
( nil = sK3
| ~ ssList(sK3)
| spl10_3
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f265,f239]) ).
fof(f239,plain,
( ssList(nil)
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f238]) ).
fof(f238,plain,
( spl10_6
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f265,plain,
( ~ ssList(nil)
| ~ ssList(sK3)
| nil = sK3
| spl10_3 ),
inference(resolution,[],[f168,f226]) ).
fof(f226,plain,
( ~ neq(sK3,nil)
| spl10_3 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl10_3
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f168,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f253,plain,
( ~ spl10_4
| spl10_5 ),
inference(avatar_split_clause,[],[f204,f233,f229]) ).
fof(f233,plain,
( spl10_5
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f204,plain,
( nil = sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f176,f181,f175]) ).
fof(f175,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f140]) ).
fof(f181,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f140]) ).
fof(f176,plain,
( nil != sK5
| nil = sK4 ),
inference(cnf_transformation,[],[f140]) ).
fof(f252,plain,
( ~ spl10_3
| spl10_2 ),
inference(avatar_split_clause,[],[f203,f219,f224]) ).
fof(f219,plain,
( spl10_2
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f203,plain,
( segmentP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f178,f181,f175,f181]) ).
fof(f178,plain,
( segmentP(sK5,sK4)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f140]) ).
fof(f251,plain,
spl10_6,
inference(avatar_split_clause,[],[f158,f238]) ).
fof(f158,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f236,plain,
( ~ spl10_4
| ~ spl10_5 ),
inference(avatar_split_clause,[],[f177,f233,f229]) ).
fof(f177,plain,
( nil != sK2
| nil != sK3 ),
inference(cnf_transformation,[],[f140]) ).
fof(f227,plain,
( ~ spl10_3
| spl10_1 ),
inference(avatar_split_clause,[],[f202,f215,f224]) ).
fof(f215,plain,
( spl10_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f202,plain,
( neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f179,f175,f181]) ).
fof(f179,plain,
( neq(sK4,nil)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f140]) ).
fof(f222,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f182,f219,f215]) ).
fof(f182,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(cnf_transformation,[],[f140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10 % 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.30 % Computer : n017.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Aug 30 17:41:20 EDT 2022
% 0.15/0.30 % CPUTime :
% 0.15/0.44 % (2254)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.15/0.45 % (2254)Instruction limit reached!
% 0.15/0.45 % (2254)------------------------------
% 0.15/0.45 % (2254)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.45 % (2246)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.15/0.45 % (2254)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.45 % (2254)Termination reason: Unknown
% 0.15/0.45 % (2254)Termination phase: Naming
% 0.15/0.45
% 0.15/0.45 % (2254)Memory used [KB]: 1535
% 0.15/0.45 % (2254)Time elapsed: 0.004 s
% 0.15/0.45 % (2254)Instructions burned: 3 (million)
% 0.15/0.45 % (2254)------------------------------
% 0.15/0.45 % (2254)------------------------------
% 0.15/0.46 % (2246)First to succeed.
% 0.15/0.46 % (2263)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.15/0.46 % (2246)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (2246)------------------------------
% 0.15/0.46 % (2246)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.46 % (2246)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.46 % (2246)Termination reason: Refutation
% 0.15/0.46
% 0.15/0.46 % (2246)Memory used [KB]: 6140
% 0.15/0.46 % (2246)Time elapsed: 0.096 s
% 0.15/0.46 % (2246)Instructions burned: 5 (million)
% 0.15/0.46 % (2246)------------------------------
% 0.15/0.46 % (2246)------------------------------
% 0.15/0.46 % (2239)Success in time 0.154 s
%------------------------------------------------------------------------------