TSTP Solution File: SWC217+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC217+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 : n010.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:39:40 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 11 unt; 0 def)
% Number of atoms : 273 ( 89 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 319 ( 98 ~; 77 |; 118 &)
% ( 7 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 24 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f294,plain,
$false,
inference(avatar_sat_refutation,[],[f243,f248,f253,f254,f265,f293]) ).
fof(f293,plain,
( spl11_3
| ~ spl11_5 ),
inference(avatar_contradiction_clause,[],[f292]) ).
fof(f292,plain,
( $false
| spl11_3
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f291,f227]) ).
fof(f227,plain,
( nil != sK8
| spl11_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl11_3
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f291,plain,
( nil = sK8
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f290,f183]) ).
fof(f183,plain,
ssList(sK8),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
( ssList(sK6)
& ssList(sK7)
& ( ( memberP(sK9,sK10)
& cons(sK10,nil) = sK8
& ssItem(sK10) )
| ~ neq(sK9,nil) )
& ssList(sK9)
& neq(sK7,nil)
& sK9 = sK7
& ~ neq(sK6,nil)
& sK6 = sK8
& ( nil = sK8
| nil != sK9 )
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f120,f147,f146,f145,f144,f143]) ).
fof(f143,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(X1,nil)
& X1 = X3
& ~ neq(X0,nil)
& X0 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) ) ) )
=> ( ssList(sK6)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(X1,nil)
& X1 = X3
& ~ neq(sK6,nil)
& sK6 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(X1,nil)
& X1 = X3
& ~ neq(sK6,nil)
& sK6 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) ) )
=> ( ssList(sK7)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(sK7,nil)
& sK7 = X3
& ~ neq(sK6,nil)
& sK6 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(sK7,nil)
& sK7 = X3
& ~ neq(sK6,nil)
& sK6 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) )
=> ( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK8
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(sK7,nil)
& sK7 = X3
& ~ neq(sK6,nil)
& sK6 = sK8
& ( nil = sK8
| nil != X3 ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK8
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(sK7,nil)
& sK7 = X3
& ~ neq(sK6,nil)
& sK6 = sK8
& ( nil = sK8
| nil != X3 ) )
=> ( ( ? [X4] :
( memberP(sK9,X4)
& cons(X4,nil) = sK8
& ssItem(X4) )
| ~ neq(sK9,nil) )
& ssList(sK9)
& neq(sK7,nil)
& sK9 = sK7
& ~ neq(sK6,nil)
& sK6 = sK8
& ( nil = sK8
| nil != sK9 ) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X4] :
( memberP(sK9,X4)
& cons(X4,nil) = sK8
& ssItem(X4) )
=> ( memberP(sK9,sK10)
& cons(sK10,nil) = sK8
& ssItem(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3)
& neq(X1,nil)
& X1 = X3
& ~ neq(X0,nil)
& X0 = X2
& ( nil = X2
| nil != X3 ) )
& ssList(X2) ) ) ),
inference(flattening,[],[f119]) ).
fof(f119,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ~ neq(X0,nil)
& X0 = X2
& 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)
| ( nil != X2
& nil = X3 )
| X1 != X3
| ( ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) )
& neq(X3,nil) )
| neq(X0,nil)
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| X1 != X3
| ( ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) )
& neq(X3,nil) )
| neq(X0,nil)
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f290,plain,
( ~ ssList(sK8)
| nil = sK8
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f285,f236]) ).
fof(f236,plain,
( ssList(nil)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl11_5
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f285,plain,
( ~ ssList(nil)
| ~ ssList(sK8)
| nil = sK8 ),
inference(resolution,[],[f176,f204]) ).
fof(f204,plain,
~ neq(sK8,nil),
inference(definition_unfolding,[],[f186,f185]) ).
fof(f185,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f148]) ).
fof(f186,plain,
~ neq(sK6,nil),
inference(cnf_transformation,[],[f148]) ).
fof(f176,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f265,plain,
( ~ spl11_3
| ~ spl11_5
| ~ spl11_7
| ~ spl11_8 ),
inference(avatar_split_clause,[],[f264,f250,f245,f235,f226]) ).
fof(f245,plain,
( spl11_7
<=> cons(sK10,nil) = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
fof(f250,plain,
( spl11_8
<=> ssItem(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
fof(f264,plain,
( nil != sK8
| ~ spl11_5
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f263,f236]) ).
fof(f263,plain,
( ~ ssList(nil)
| nil != sK8
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f262,f252]) ).
fof(f252,plain,
( ssItem(sK10)
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f262,plain,
( ~ ssItem(sK10)
| nil != sK8
| ~ ssList(nil)
| ~ spl11_7 ),
inference(superposition,[],[f154,f247]) ).
fof(f247,plain,
( cons(sK10,nil) = sK8
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f154,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f254,plain,
spl11_2,
inference(avatar_split_clause,[],[f188,f221]) ).
fof(f221,plain,
( spl11_2
<=> neq(sK7,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f188,plain,
neq(sK7,nil),
inference(cnf_transformation,[],[f148]) ).
fof(f253,plain,
( spl11_8
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f202,f221,f250]) ).
fof(f202,plain,
( ~ neq(sK7,nil)
| ssItem(sK10) ),
inference(definition_unfolding,[],[f190,f187]) ).
fof(f187,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f148]) ).
fof(f190,plain,
( ssItem(sK10)
| ~ neq(sK9,nil) ),
inference(cnf_transformation,[],[f148]) ).
fof(f248,plain,
( spl11_7
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f201,f221,f245]) ).
fof(f201,plain,
( ~ neq(sK7,nil)
| cons(sK10,nil) = sK8 ),
inference(definition_unfolding,[],[f191,f187]) ).
fof(f191,plain,
( cons(sK10,nil) = sK8
| ~ neq(sK9,nil) ),
inference(cnf_transformation,[],[f148]) ).
fof(f243,plain,
spl11_5,
inference(avatar_split_clause,[],[f166,f235]) ).
fof(f166,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n010.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:27:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (23706)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.19/0.51 % (23698)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.19/0.51 % (23690)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.19/0.51 % (23698)Instruction limit reached!
% 0.19/0.51 % (23698)------------------------------
% 0.19/0.51 % (23698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (23698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (23698)Termination reason: Unknown
% 0.19/0.51 % (23698)Termination phase: Naming
% 0.19/0.51
% 0.19/0.51 % (23698)Memory used [KB]: 1535
% 0.19/0.51 % (23698)Time elapsed: 0.004 s
% 0.19/0.51 % (23698)Instructions burned: 3 (million)
% 0.19/0.51 % (23698)------------------------------
% 0.19/0.51 % (23698)------------------------------
% 0.19/0.52 % (23690)First to succeed.
% 0.19/0.52 % (23706)Also succeeded, but the first one will report.
% 0.19/0.52 % (23690)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (23690)------------------------------
% 0.19/0.52 % (23690)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (23690)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (23690)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (23690)Memory used [KB]: 6140
% 0.19/0.52 % (23690)Time elapsed: 0.064 s
% 0.19/0.52 % (23690)Instructions burned: 5 (million)
% 0.19/0.52 % (23690)------------------------------
% 0.19/0.52 % (23690)------------------------------
% 0.19/0.52 % (23679)Success in time 0.168 s
%------------------------------------------------------------------------------