TSTP Solution File: SWC060+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC060+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 : n025.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:29 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 78 ( 7 unt; 0 def)
% Number of atoms : 381 ( 98 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 474 ( 171 ~; 172 |; 109 &)
% ( 10 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 54 ( 32 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f303,plain,
$false,
inference(avatar_sat_refutation,[],[f227,f237,f242,f253,f254,f259,f263,f264,f276,f284,f293,f302]) ).
fof(f302,plain,
( ~ spl10_1
| spl10_4
| ~ spl10_5
| ~ spl10_8 ),
inference(avatar_contradiction_clause,[],[f301]) ).
fof(f301,plain,
( $false
| ~ spl10_1
| spl10_4
| ~ spl10_5
| ~ spl10_8 ),
inference(subsumption_resolution,[],[f300,f258]) ).
fof(f258,plain,
( segmentP(nil,nil)
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl10_8
<=> segmentP(nil,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f300,plain,
( ~ segmentP(nil,nil)
| ~ spl10_1
| spl10_4
| ~ spl10_5 ),
inference(forward_demodulation,[],[f299,f241]) ).
fof(f241,plain,
( nil = sK7
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f239,plain,
( spl10_5
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f299,plain,
( ~ segmentP(sK7,nil)
| ~ spl10_1
| spl10_4 ),
inference(forward_demodulation,[],[f235,f221]) ).
fof(f221,plain,
( nil = sK8
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl10_1
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f235,plain,
( ~ segmentP(sK7,sK8)
| spl10_4 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f234,plain,
( spl10_4
<=> segmentP(sK7,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f293,plain,
( ~ spl10_1
| ~ spl10_2
| spl10_3
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f292]) ).
fof(f292,plain,
( $false
| ~ spl10_1
| ~ spl10_2
| spl10_3
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f289,f288]) ).
fof(f288,plain,
( ~ neq(nil,nil)
| ~ spl10_1
| spl10_3 ),
inference(forward_demodulation,[],[f230,f221]) ).
fof(f230,plain,
( ~ neq(sK8,nil)
| spl10_3 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl10_3
<=> neq(sK8,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f289,plain,
( neq(nil,nil)
| ~ spl10_2
| ~ spl10_5 ),
inference(backward_demodulation,[],[f226,f241]) ).
fof(f226,plain,
( neq(sK7,nil)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl10_2
<=> neq(sK7,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f284,plain,
( ~ spl10_3
| ~ spl10_4
| ~ spl10_9 ),
inference(avatar_split_clause,[],[f281,f261,f234,f229]) ).
fof(f261,plain,
( spl10_9
<=> ! [X4] :
( ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
fof(f281,plain,
( ~ neq(sK8,nil)
| ~ spl10_4
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f280,f236]) ).
fof(f236,plain,
( segmentP(sK7,sK8)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f280,plain,
( ~ neq(sK8,nil)
| ~ segmentP(sK7,sK8)
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f279,f184]) ).
fof(f184,plain,
ssList(sK8),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
( sK9 = sK7
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(sK9)
& ( ( nil = sK9
& nil = sK8 )
| ( neq(sK8,nil)
& segmentP(sK9,sK8) ) )
& sK6 = sK8
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f128,f148,f147,f146,f145]) ).
fof(f145,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& sK6 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& sK6 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK7 = X3
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& sK6 = X2 )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X2] :
( ? [X3] :
( sK7 = X3
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& sK6 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( sK7 = X3
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = sK8 )
| ( neq(sK8,nil)
& segmentP(X3,sK8) ) )
& sK6 = sK8 )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X3] :
( sK7 = X3
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(X3)
& ( ( nil = X3
& nil = sK8 )
| ( neq(sK8,nil)
& segmentP(X3,sK8) ) )
& sK6 = sK8 )
=> ( sK9 = sK7
& ( ( neq(sK7,nil)
& ! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = sK7
& nil != sK6 ) )
& ssList(sK9)
& ( ( nil = sK9
& nil = sK8 )
| ( neq(sK8,nil)
& segmentP(sK9,sK8) ) )
& sK6 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4)
& neq(X4,nil) ) )
& ( nil != X1
| nil = X0 ) )
| X1 != X3
| X0 != X2
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) )
& ( nil != X2
| nil != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4)
& neq(X4,nil) ) )
& ( nil != X1
| nil = X0 ) )
| X1 != X3
| X0 != X2
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) )
& ( nil != X2
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f279,plain,
( ~ ssList(sK8)
| ~ segmentP(sK7,sK8)
| ~ neq(sK8,nil)
| ~ spl10_9 ),
inference(duplicate_literal_removal,[],[f277]) ).
fof(f277,plain,
( ~ ssList(sK8)
| ~ segmentP(sK7,sK8)
| ~ ssList(sK8)
| ~ neq(sK8,nil)
| ~ spl10_9 ),
inference(resolution,[],[f262,f167]) ).
fof(f167,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f262,plain,
( ! [X4] :
( ~ segmentP(sK8,X4)
| ~ ssList(X4)
| ~ segmentP(sK7,X4)
| ~ neq(X4,nil) )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f276,plain,
( spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f275]) ).
fof(f275,plain,
( $false
| spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f274,f184]) ).
fof(f274,plain,
( ~ ssList(sK8)
| spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f268,f222]) ).
fof(f222,plain,
( nil != sK8
| spl10_1 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f268,plain,
( nil = sK8
| ~ ssList(sK8)
| ~ spl10_4
| ~ spl10_5 ),
inference(resolution,[],[f155,f265]) ).
fof(f265,plain,
( segmentP(nil,sK8)
| ~ spl10_4
| ~ spl10_5 ),
inference(backward_demodulation,[],[f236,f241]) ).
fof(f155,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f264,plain,
( spl10_5
| spl10_9 ),
inference(avatar_split_clause,[],[f203,f261,f239]) ).
fof(f203,plain,
! [X4] :
( ~ segmentP(sK8,X4)
| ~ segmentP(sK7,X4)
| ~ ssList(X4)
| nil = sK7
| ~ neq(X4,nil) ),
inference(definition_unfolding,[],[f192,f185]) ).
fof(f185,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f149]) ).
fof(f192,plain,
! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK7 ),
inference(cnf_transformation,[],[f149]) ).
fof(f263,plain,
( ~ spl10_1
| spl10_9 ),
inference(avatar_split_clause,[],[f204,f261,f220]) ).
fof(f204,plain,
! [X4] :
( ~ segmentP(sK8,X4)
| nil != sK8
| ~ neq(X4,nil)
| ~ segmentP(sK7,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f191,f185,f185]) ).
fof(f191,plain,
! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK6 ),
inference(cnf_transformation,[],[f149]) ).
fof(f259,plain,
( ~ spl10_6
| spl10_8 ),
inference(avatar_split_clause,[],[f210,f256,f244]) ).
fof(f244,plain,
( spl10_6
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f210,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(nil,X0)
| nil != X0 ),
inference(cnf_transformation,[],[f129]) ).
fof(f254,plain,
spl10_6,
inference(avatar_split_clause,[],[f198,f244]) ).
fof(f198,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f253,plain,
( spl10_4
| spl10_5 ),
inference(avatar_split_clause,[],[f207,f239,f234]) ).
fof(f207,plain,
( nil = sK7
| segmentP(sK7,sK8) ),
inference(definition_unfolding,[],[f188,f195,f195]) ).
fof(f195,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f149]) ).
fof(f188,plain,
( nil = sK9
| segmentP(sK9,sK8) ),
inference(cnf_transformation,[],[f149]) ).
fof(f242,plain,
( spl10_5
| spl10_3 ),
inference(avatar_split_clause,[],[f206,f229,f239]) ).
fof(f206,plain,
( neq(sK8,nil)
| nil = sK7 ),
inference(definition_unfolding,[],[f189,f195]) ).
fof(f189,plain,
( nil = sK9
| neq(sK8,nil) ),
inference(cnf_transformation,[],[f149]) ).
fof(f237,plain,
( spl10_4
| spl10_1 ),
inference(avatar_split_clause,[],[f208,f220,f234]) ).
fof(f208,plain,
( nil = sK8
| segmentP(sK7,sK8) ),
inference(definition_unfolding,[],[f186,f195]) ).
fof(f186,plain,
( nil = sK8
| segmentP(sK9,sK8) ),
inference(cnf_transformation,[],[f149]) ).
fof(f227,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f202,f224,f220]) ).
fof(f202,plain,
( neq(sK7,nil)
| nil != sK8 ),
inference(definition_unfolding,[],[f193,f185]) ).
fof(f193,plain,
( neq(sK7,nil)
| nil != sK6 ),
inference(cnf_transformation,[],[f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC060+1 : TPTP v8.1.0. Released v2.4.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.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:13:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.55 % (26081)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.56 % (26089)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.21/0.56 % (26080)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.56 % (26080)First to succeed.
% 0.21/0.57 % (26096)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.57 % (26097)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.21/0.57 % (26088)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.57 % (26089)Instruction limit reached!
% 0.21/0.57 % (26089)------------------------------
% 0.21/0.57 % (26089)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (26080)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (26080)------------------------------
% 0.21/0.57 % (26080)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (26080)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (26080)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (26080)Memory used [KB]: 6140
% 0.21/0.57 % (26080)Time elapsed: 0.130 s
% 0.21/0.57 % (26080)Instructions burned: 6 (million)
% 0.21/0.57 % (26080)------------------------------
% 0.21/0.57 % (26080)------------------------------
% 0.21/0.57 % (26073)Success in time 0.215 s
%------------------------------------------------------------------------------