TSTP Solution File: SWC258+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC258+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 : n021.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:56 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 54 ( 7 unt; 0 def)
% Number of atoms : 305 ( 97 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 359 ( 108 ~; 105 |; 123 &)
% ( 6 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 31 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f325,plain,
$false,
inference(avatar_sat_refutation,[],[f301,f303,f305,f306,f313,f318,f324]) ).
fof(f324,plain,
( ~ spl17_1
| ~ spl17_6
| ~ spl17_8 ),
inference(avatar_contradiction_clause,[],[f323]) ).
fof(f323,plain,
( $false
| ~ spl17_1
| ~ spl17_6
| ~ spl17_8 ),
inference(subsumption_resolution,[],[f322,f234]) ).
fof(f234,plain,
~ totalorderedP(sK9),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
( ~ totalorderedP(sK9)
& ssList(sK12)
& sK10 = sK12
& sK11 = sK9
& ( ( ! [X5] :
( ~ memberP(sK12,X5)
| sK13 = X5
| ~ ssItem(X5)
| ~ leq(X5,sK13) )
& memberP(sK12,sK13)
& ssItem(sK13)
& sK11 = cons(sK13,nil) )
| ( nil = sK11
& nil = sK12 ) )
& ssList(sK11)
& ssList(sK10)
& ssList(sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13])],[f128,f166,f165,f164,f163,f162]) ).
fof(f162,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& ssList(X3)
& X1 = X3
& X0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& X1 = X3
& sK9 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& X1 = X3
& sK9 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& sK10 = X3
& sK9 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& sK10 = X3
& sK9 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& sK10 = X3
& sK11 = sK9
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK11 )
| ( nil = sK11
& nil = X3 ) ) )
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
( ? [X3] :
( ~ totalorderedP(sK9)
& ssList(X3)
& sK10 = X3
& sK11 = sK9
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK11 )
| ( nil = sK11
& nil = X3 ) ) )
=> ( ~ totalorderedP(sK9)
& ssList(sK12)
& sK10 = sK12
& sK11 = sK9
& ( ? [X4] :
( ! [X5] :
( ~ memberP(sK12,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(sK12,X4)
& ssItem(X4)
& cons(X4,nil) = sK11 )
| ( nil = sK11
& nil = sK12 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
( ? [X4] :
( ! [X5] :
( ~ memberP(sK12,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(sK12,X4)
& ssItem(X4)
& cons(X4,nil) = sK11 )
=> ( ! [X5] :
( ~ memberP(sK12,X5)
| sK13 = X5
| ~ ssItem(X5)
| ~ leq(X5,sK13) )
& memberP(sK12,sK13)
& ssItem(sK13)
& sK11 = cons(sK13,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& ssList(X3)
& X1 = X3
& X0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f127,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ totalorderedP(X0)
& X1 = X3
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5)
| ~ leq(X5,X4) )
& ssItem(X4) )
| ( nil = X2
& nil = 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
| totalorderedP(X0)
| X1 != X3
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( X4 != X5
& memberP(X3,X5)
& leq(X5,X4)
& ssItem(X5) ) ) )
& ( nil != X2
| nil != X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| totalorderedP(X0)
| X1 != X3
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( X4 != X5
& memberP(X3,X5)
& leq(X5,X4)
& ssItem(X5) ) ) )
& ( nil != X2
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f322,plain,
( totalorderedP(sK9)
| ~ spl17_1
| ~ spl17_6
| ~ spl17_8 ),
inference(subsumption_resolution,[],[f321,f264]) ).
fof(f264,plain,
( ssItem(sK13)
| ~ spl17_1 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl17_1
<=> ssItem(sK13) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_1])]) ).
fof(f321,plain,
( ~ ssItem(sK13)
| totalorderedP(sK9)
| ~ spl17_6
| ~ spl17_8 ),
inference(superposition,[],[f285,f294]) ).
fof(f294,plain,
( cons(sK13,nil) = sK9
| ~ spl17_8 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f292,plain,
( spl17_8
<=> cons(sK13,nil) = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_8])]) ).
fof(f285,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl17_6 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl17_6
<=> ! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).
fof(f318,plain,
( ~ spl17_1
| ~ spl17_2
| ~ spl17_4 ),
inference(avatar_contradiction_clause,[],[f317]) ).
fof(f317,plain,
( $false
| ~ spl17_1
| ~ spl17_2
| ~ spl17_4 ),
inference(subsumption_resolution,[],[f316,f264]) ).
fof(f316,plain,
( ~ ssItem(sK13)
| ~ spl17_2
| ~ spl17_4 ),
inference(resolution,[],[f173,f315]) ).
fof(f315,plain,
( memberP(nil,sK13)
| ~ spl17_2
| ~ spl17_4 ),
inference(forward_demodulation,[],[f277,f268]) ).
fof(f268,plain,
( nil = sK12
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f266,plain,
( spl17_2
<=> nil = sK12 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f277,plain,
( memberP(sK12,sK13)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f275,plain,
( spl17_4
<=> memberP(sK12,sK13) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f173,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f313,plain,
~ spl17_7,
inference(avatar_contradiction_clause,[],[f312]) ).
fof(f312,plain,
( $false
| ~ spl17_7 ),
inference(subsumption_resolution,[],[f242,f309]) ).
fof(f309,plain,
( ~ totalorderedP(nil)
| ~ spl17_7 ),
inference(backward_demodulation,[],[f234,f290]) ).
fof(f290,plain,
( nil = sK9
| ~ spl17_7 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f288,plain,
( spl17_7
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_7])]) ).
fof(f242,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f306,plain,
( spl17_7
| spl17_4 ),
inference(avatar_split_clause,[],[f246,f275,f288]) ).
fof(f246,plain,
( memberP(sK12,sK13)
| nil = sK9 ),
inference(definition_unfolding,[],[f228,f231]) ).
fof(f231,plain,
sK11 = sK9,
inference(cnf_transformation,[],[f167]) ).
fof(f228,plain,
( memberP(sK12,sK13)
| nil = sK11 ),
inference(cnf_transformation,[],[f167]) ).
fof(f305,plain,
spl17_6,
inference(avatar_split_clause,[],[f241,f284]) ).
fof(f241,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f303,plain,
( spl17_2
| spl17_8 ),
inference(avatar_split_clause,[],[f249,f292,f266]) ).
fof(f249,plain,
( cons(sK13,nil) = sK9
| nil = sK12 ),
inference(definition_unfolding,[],[f223,f231]) ).
fof(f223,plain,
( sK11 = cons(sK13,nil)
| nil = sK12 ),
inference(cnf_transformation,[],[f167]) ).
fof(f301,plain,
( spl17_7
| spl17_1 ),
inference(avatar_split_clause,[],[f247,f262,f288]) ).
fof(f247,plain,
( ssItem(sK13)
| nil = sK9 ),
inference(definition_unfolding,[],[f226,f231]) ).
fof(f226,plain,
( ssItem(sK13)
| nil = sK11 ),
inference(cnf_transformation,[],[f167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC258+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 18:36:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (29200)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.50 % (29211)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.51 % (29202)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (29207)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.21/0.51 % (29215)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.51 % (29209)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51 % (29221)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.51 % (29208)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.52 % (29201)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (29201)Instruction limit reached!
% 0.21/0.52 % (29201)------------------------------
% 0.21/0.52 % (29201)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (29201)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (29201)Termination reason: Unknown
% 0.21/0.52 % (29201)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (29201)Memory used [KB]: 1535
% 0.21/0.52 % (29201)Time elapsed: 0.003 s
% 0.21/0.52 % (29201)Instructions burned: 3 (million)
% 0.21/0.52 % (29201)------------------------------
% 0.21/0.52 % (29201)------------------------------
% 0.21/0.52 % (29205)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.52 % (29199)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.21/0.52 % (29203)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.52 % (29200)Instruction limit reached!
% 0.21/0.52 % (29200)------------------------------
% 0.21/0.52 % (29200)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (29200)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (29200)Termination reason: Unknown
% 0.21/0.52 % (29200)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (29200)Memory used [KB]: 6524
% 0.21/0.52 % (29200)Time elapsed: 0.115 s
% 0.21/0.52 % (29200)Instructions burned: 14 (million)
% 0.21/0.52 % (29200)------------------------------
% 0.21/0.52 % (29200)------------------------------
% 0.21/0.52 % (29216)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (29205)First to succeed.
% 0.21/0.52 % (29204)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.52 % (29205)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (29205)------------------------------
% 0.21/0.52 % (29205)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (29205)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (29205)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (29205)Memory used [KB]: 6140
% 0.21/0.52 % (29205)Time elapsed: 0.082 s
% 0.21/0.52 % (29205)Instructions burned: 5 (million)
% 0.21/0.52 % (29205)------------------------------
% 0.21/0.52 % (29205)------------------------------
% 0.21/0.52 % (29198)Success in time 0.174 s
%------------------------------------------------------------------------------