TSTP Solution File: SWC288+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC288+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 : n028.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:40:10 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 348 ( 95 equ)
% Maximal formula atoms : 40 ( 8 avg)
% Number of connectives : 450 ( 144 ~; 115 |; 168 &)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 111 ( 51 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f742,plain,
$false,
inference(avatar_sat_refutation,[],[f630,f673,f680,f723,f725,f741]) ).
fof(f741,plain,
~ spl54_1,
inference(avatar_contradiction_clause,[],[f740]) ).
fof(f740,plain,
( $false
| ~ spl54_1 ),
inference(resolution,[],[f726,f413]) ).
fof(f413,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f726,plain,
( ~ strictorderedP(nil)
| ~ spl54_1 ),
inference(backward_demodulation,[],[f423,f602]) ).
fof(f602,plain,
( nil = sK21
| ~ spl54_1 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f600,plain,
( spl54_1
<=> nil = sK21 ),
introduced(avatar_definition,[new_symbols(naming,[spl54_1])]) ).
fof(f423,plain,
~ strictorderedP(sK21),
inference(cnf_transformation,[],[f270]) ).
fof(f270,plain,
( ssList(sK21)
& ssList(sK23)
& sK23 = sK21
& ssList(sK24)
& ( ( ssList(sK26)
& ssList(sK27)
& sK24 = app(app(sK26,sK23),sK27)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(sK26,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(sK27,X8)
| ~ lt(X8,sK25) )
& ssItem(sK25) )
| ( nil = sK24
& nil = sK23 ) )
& ~ strictorderedP(sK21)
& sK24 = sK22
& ssList(sK22) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23,sK24,sK25,sK26,sK27])],[f141,f269,f268,f267,f266,f265,f264,f263]) ).
fof(f263,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(X0)
& X1 = X3 ) )
& ssList(X1) ) )
=> ( ssList(sK21)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK21 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(sK21)
& X1 = X3 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f264,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK21 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(sK21)
& X1 = X3 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK21 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(sK21)
& sK22 = X3 ) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f265,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK21 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(sK21)
& sK22 = X3 ) )
=> ( ssList(sK23)
& ? [X3] :
( sK23 = sK21
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,sK23),X6) = X3
& cons(X4,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = sK23 ) )
& ~ strictorderedP(sK21)
& sK22 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f266,plain,
( ? [X3] :
( sK23 = sK21
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,sK23),X6) = X3
& cons(X4,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = sK23 ) )
& ~ strictorderedP(sK21)
& sK22 = X3 )
=> ( sK23 = sK21
& ssList(sK24)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& sK24 = app(app(X5,sK23),X6)
& cons(X4,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = sK24
& nil = sK23 ) )
& ~ strictorderedP(sK21)
& sK24 = sK22 ) ),
introduced(choice_axiom,[]) ).
fof(f267,plain,
( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& sK24 = app(app(X5,sK23),X6)
& cons(X4,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
=> ( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& sK24 = app(app(X5,sK23),X6)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,sK25) ) ) )
& ssItem(sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f268,plain,
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& sK24 = app(app(X5,sK23),X6)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,sK25) ) ) )
=> ( ssList(sK26)
& ? [X6] :
( ssList(X6)
& sK24 = app(app(sK26,sK23),X6)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(sK26,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,sK25) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f269,plain,
( ? [X6] :
( ssList(X6)
& sK24 = app(app(sK26,sK23),X6)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(sK26,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,sK25) ) )
=> ( ssList(sK27)
& sK24 = app(app(sK26,sK23),sK27)
& cons(sK25,nil) = sK23
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(sK25,X7)
| ~ memberP(sK26,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(sK27,X8)
| ~ lt(X8,sK25) ) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| ~ memberP(X5,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) ) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ~ strictorderedP(X0)
& X1 = X3 ) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( cons(X4,nil) != X2
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| app(app(X5,X2),X6) != X3
| ~ ssList(X6)
| ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) ) ) ) ) )
| strictorderedP(X0)
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( cons(X4,nil) != X2
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| app(app(X5,X2),X6) != X3
| ~ ssList(X6)
| ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) ) ) ) ) )
| strictorderedP(X0)
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f725,plain,
~ spl54_23,
inference(avatar_contradiction_clause,[],[f724]) ).
fof(f724,plain,
( $false
| ~ spl54_23 ),
inference(resolution,[],[f722,f423]) ).
fof(f722,plain,
( strictorderedP(sK21)
| ~ spl54_23 ),
inference(avatar_component_clause,[],[f720]) ).
fof(f720,plain,
( spl54_23
<=> strictorderedP(sK21) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_23])]) ).
fof(f723,plain,
( ~ spl54_7
| spl54_23
| ~ spl54_15
| ~ spl54_16 ),
inference(avatar_split_clause,[],[f718,f675,f670,f720,f627]) ).
fof(f627,plain,
( spl54_7
<=> ssItem(sK25) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_7])]) ).
fof(f670,plain,
( spl54_15
<=> cons(sK25,nil) = sK21 ),
introduced(avatar_definition,[new_symbols(naming,[spl54_15])]) ).
fof(f675,plain,
( spl54_16
<=> ! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_16])]) ).
fof(f718,plain,
( strictorderedP(sK21)
| ~ ssItem(sK25)
| ~ spl54_15
| ~ spl54_16 ),
inference(superposition,[],[f676,f672]) ).
fof(f672,plain,
( cons(sK25,nil) = sK21
| ~ spl54_15 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f676,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl54_16 ),
inference(avatar_component_clause,[],[f675]) ).
fof(f680,plain,
spl54_16,
inference(avatar_split_clause,[],[f356,f675]) ).
fof(f356,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f673,plain,
( spl54_15
| spl54_1 ),
inference(avatar_split_clause,[],[f558,f600,f670]) ).
fof(f558,plain,
( nil = sK21
| cons(sK25,nil) = sK21 ),
inference(definition_unfolding,[],[f430,f439,f439]) ).
fof(f439,plain,
sK23 = sK21,
inference(cnf_transformation,[],[f270]) ).
fof(f430,plain,
( cons(sK25,nil) = sK23
| nil = sK23 ),
inference(cnf_transformation,[],[f270]) ).
fof(f630,plain,
( spl54_7
| spl54_1 ),
inference(avatar_split_clause,[],[f564,f600,f627]) ).
fof(f564,plain,
( nil = sK21
| ssItem(sK25) ),
inference(definition_unfolding,[],[f424,f439]) ).
fof(f424,plain,
( ssItem(sK25)
| nil = sK23 ),
inference(cnf_transformation,[],[f270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC288+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.13/0.34 % Computer : n028.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:53:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (13702)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.47 % (13690)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.19/0.47 % (13694)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.47 % (13694)Instruction limit reached!
% 0.19/0.47 % (13694)------------------------------
% 0.19/0.47 % (13694)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (13694)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (13694)Termination reason: Unknown
% 0.19/0.47 % (13694)Termination phase: Preprocessing 3
% 0.19/0.47
% 0.19/0.47 % (13694)Memory used [KB]: 1535
% 0.19/0.47 % (13694)Time elapsed: 0.005 s
% 0.19/0.47 % (13694)Instructions burned: 3 (million)
% 0.19/0.47 % (13694)------------------------------
% 0.19/0.47 % (13694)------------------------------
% 0.19/0.48 % (13698)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.48 % (13698)Instruction limit reached!
% 0.19/0.48 % (13698)------------------------------
% 0.19/0.48 % (13698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (13698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (13698)Termination reason: Unknown
% 0.19/0.48 % (13698)Termination phase: Preprocessing 2
% 0.19/0.48
% 0.19/0.48 % (13698)Memory used [KB]: 1535
% 0.19/0.48 % (13698)Time elapsed: 0.003 s
% 0.19/0.48 % (13698)Instructions burned: 2 (million)
% 0.19/0.48 % (13698)------------------------------
% 0.19/0.48 % (13698)------------------------------
% 0.19/0.48 % (13689)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.19/0.48 % (13690)Instruction limit reached!
% 0.19/0.48 % (13690)------------------------------
% 0.19/0.48 % (13690)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (13690)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (13690)Termination reason: Unknown
% 0.19/0.48 % (13690)Termination phase: Saturation
% 0.19/0.48
% 0.19/0.48 % (13690)Memory used [KB]: 6268
% 0.19/0.48 % (13690)Time elapsed: 0.084 s
% 0.19/0.48 % (13690)Instructions burned: 12 (million)
% 0.19/0.48 % (13690)------------------------------
% 0.19/0.48 % (13690)------------------------------
% 0.19/0.49 % (13702)First to succeed.
% 0.19/0.49 % (13702)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (13702)------------------------------
% 0.19/0.49 % (13702)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (13702)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (13702)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (13702)Memory used [KB]: 6396
% 0.19/0.49 % (13702)Time elapsed: 0.073 s
% 0.19/0.49 % (13702)Instructions burned: 14 (million)
% 0.19/0.49 % (13702)------------------------------
% 0.19/0.49 % (13702)------------------------------
% 0.19/0.49 % (13679)Success in time 0.139 s
%------------------------------------------------------------------------------