TSTP Solution File: SWC249+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC249+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:39:53 EDT 2022
% Result : Theorem 1.85s 0.60s
% Output : Refutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of formulae : 77 ( 6 unt; 0 def)
% Number of atoms : 549 ( 104 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 754 ( 282 ~; 265 |; 180 &)
% ( 3 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 165 ( 112 !; 53 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f634,plain,
$false,
inference(avatar_sat_refutation,[],[f365,f604,f616,f633]) ).
fof(f633,plain,
( ~ spl20_1
| ~ spl20_8
| ~ spl20_9 ),
inference(avatar_contradiction_clause,[],[f632]) ).
fof(f632,plain,
( $false
| ~ spl20_1
| ~ spl20_8
| ~ spl20_9 ),
inference(subsumption_resolution,[],[f628,f599]) ).
fof(f599,plain,
( ssItem(sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_8 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f597,plain,
( spl20_8
<=> ssItem(sK19(sK2(sK15),nil,sK1(sK15))) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_8])]) ).
fof(f628,plain,
( ~ ssItem(sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1
| ~ spl20_9 ),
inference(resolution,[],[f627,f275]) ).
fof(f275,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f627,plain,
( memberP(nil,sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1
| ~ spl20_9 ),
inference(subsumption_resolution,[],[f626,f324]) ).
fof(f324,plain,
nil != sK15,
inference(cnf_transformation,[],[f222]) ).
fof(f222,plain,
( ssList(sK15)
& ssList(sK16)
& ssList(sK17)
& ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,sK17)
| ~ neq(sK17,X4)
| ~ frontsegP(sK18,X4) )
& frontsegP(sK18,sK17)
& nil != sK15
& sK18 = sK16
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ( ssItem(sK19(X5,X6,X7))
& lt(X5,sK19(X5,X6,X7))
& memberP(X6,sK19(X5,X6,X7))
& ~ leq(X5,sK19(X5,X6,X7))
& memberP(X7,sK19(X5,X6,X7)) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(sK18)
& sK17 = sK15
& strictorderedP(sK17) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19])],[f130,f221,f220,f219,f218,f217]) ).
fof(f217,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != X0
& X1 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != X0
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& X0 = X2
& strictorderedP(X2) ) ) ) )
=> ( ssList(sK15)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != sK15
& X1 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK15 = X2
& strictorderedP(X2) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f218,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != sK15
& X1 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK15 = X2
& strictorderedP(X2) ) ) )
=> ( ssList(sK16)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != sK15
& sK16 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK15 = X2
& strictorderedP(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f219,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != sK15
& sK16 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK15 = X2
& strictorderedP(X2) ) )
=> ( ssList(sK17)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,sK17)
| ~ neq(sK17,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,sK17)
& nil != sK15
& sK16 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK17 = sK15
& strictorderedP(sK17) ) ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
( ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,sK17)
| ~ neq(sK17,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,sK17)
& nil != sK15
& sK16 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& sK17 = sK15
& strictorderedP(sK17) )
=> ( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,sK17)
| ~ neq(sK17,X4)
| ~ frontsegP(sK18,X4) )
& frontsegP(sK18,sK17)
& nil != sK15
& sK18 = sK16
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(sK18)
& sK17 = sK15
& strictorderedP(sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f221,plain,
! [X5,X6,X7] :
( ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
=> ( ssItem(sK19(X5,X6,X7))
& lt(X5,sK19(X5,X6,X7))
& memberP(X6,sK19(X5,X6,X7))
& ~ leq(X5,sK19(X5,X6,X7))
& memberP(X7,sK19(X5,X6,X7)) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& frontsegP(X3,X2)
& nil != X0
& X1 = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(app(X6,cons(X5,nil)),X7) != X0
| ? [X8] :
( ssItem(X8)
& lt(X5,X8)
& memberP(X6,X8)
& ~ leq(X5,X8)
& memberP(X7,X8) )
| ~ ssList(X7) ) )
| ~ ssItem(X5) )
& ssList(X3)
& X0 = X2
& strictorderedP(X2) ) ) ) ),
inference(flattening,[],[f129]) ).
fof(f129,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4) )
& nil != X0
& strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X0
| ? [X8] :
( ~ leq(X5,X8)
& memberP(X6,X8)
& lt(X5,X8)
& memberP(X7,X8)
& ssItem(X8) ) ) )
| ~ ssItem(X5) )
& X0 = X2
& frontsegP(X3,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)
=> ( X1 != X3
| ? [X4] :
( strictorderedP(X4)
& ssList(X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& neq(X2,X4) )
| nil = X0
| ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X0
& ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8) ) ) ) )
& ssItem(X5) )
| X0 != X2
| ~ frontsegP(X3,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ? [X4] :
( strictorderedP(X4)
& ssList(X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& neq(X2,X4) )
| nil = X0
| ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X0
& ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8) ) ) ) )
& ssItem(X5) )
| X0 != X2
| ~ frontsegP(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f626,plain,
( nil = sK15
| memberP(nil,sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1
| ~ spl20_9 ),
inference(subsumption_resolution,[],[f625,f602]) ).
fof(f602,plain,
( ssList(cons(sK2(sK15),nil))
| ~ spl20_9 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f601,plain,
( spl20_9
<=> ssList(cons(sK2(sK15),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_9])]) ).
fof(f625,plain,
( ~ ssList(cons(sK2(sK15),nil))
| nil = sK15
| memberP(nil,sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f624,f329]) ).
fof(f329,plain,
ssList(sK15),
inference(cnf_transformation,[],[f222]) ).
fof(f624,plain,
( ~ ssList(sK15)
| ~ ssList(cons(sK2(sK15),nil))
| nil = sK15
| memberP(nil,sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1 ),
inference(equality_resolution,[],[f572]) ).
fof(f572,plain,
( ! [X0] :
( sK15 != X0
| nil = X0
| ~ ssList(X0)
| ~ ssList(cons(sK2(X0),nil))
| memberP(nil,sK19(sK2(X0),nil,sK1(X0))) )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f571,f243]) ).
fof(f243,plain,
! [X0] :
( ssList(sK1(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f181,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( ssList(sK1(X0))
& cons(sK2(X0),sK1(X0)) = X0
& ssItem(sK2(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f118,f180,f179]) ).
fof(f179,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
=> ( ssList(sK1(X0))
& ? [X2] :
( cons(X2,sK1(X0)) = X0
& ssItem(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f180,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK1(X0)) = X0
& ssItem(X2) )
=> ( cons(sK2(X0),sK1(X0)) = X0
& ssItem(sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) ) ),
inference(flattening,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f571,plain,
( ! [X0] :
( ~ ssList(cons(sK2(X0),nil))
| memberP(nil,sK19(sK2(X0),nil,sK1(X0)))
| sK15 != X0
| ~ ssList(X0)
| ~ ssList(sK1(X0))
| nil = X0 )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f569,f241]) ).
fof(f241,plain,
! [X0] :
( ssItem(sK2(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f569,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(cons(sK2(X0),nil))
| sK15 != X0
| memberP(nil,sK19(sK2(X0),nil,sK1(X0)))
| ~ ssItem(sK2(X0))
| ~ ssList(sK1(X0))
| nil = X0 )
| ~ spl20_1 ),
inference(superposition,[],[f552,f242]) ).
fof(f242,plain,
! [X0] :
( cons(sK2(X0),sK1(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f552,plain,
( ! [X6,X7] :
( cons(X6,X7) != sK15
| ~ ssItem(X6)
| ~ ssList(X7)
| memberP(nil,sK19(X6,nil,X7))
| ~ ssList(cons(X6,nil)) )
| ~ spl20_1 ),
inference(duplicate_literal_removal,[],[f535]) ).
fof(f535,plain,
( ! [X6,X7] :
( cons(X6,X7) != sK15
| ~ ssList(X7)
| ~ ssItem(X6)
| memberP(nil,sK19(X6,nil,X7))
| ~ ssList(cons(X6,nil))
| ~ ssList(X7)
| ~ ssItem(X6) )
| ~ spl20_1 ),
inference(superposition,[],[f392,f293]) ).
fof(f293,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f392,plain,
( ! [X2,X3] :
( app(cons(X2,nil),X3) != sK15
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| memberP(nil,sK19(X2,nil,X3)) )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f388,f359]) ).
fof(f359,plain,
( ssList(nil)
| ~ spl20_1 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f358,plain,
( spl20_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_1])]) ).
fof(f388,plain,
! [X2,X3] :
( memberP(nil,sK19(X2,nil,X3))
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(nil)
| app(cons(X2,nil),X3) != sK15
| ~ ssList(cons(X2,nil)) ),
inference(superposition,[],[f320,f283]) ).
fof(f283,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f320,plain,
! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ~ ssList(X6)
| memberP(X6,sK19(X5,X6,X7))
| ~ ssList(X7)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f222]) ).
fof(f616,plain,
( ~ spl20_1
| spl20_9 ),
inference(avatar_contradiction_clause,[],[f615]) ).
fof(f615,plain,
( $false
| ~ spl20_1
| spl20_9 ),
inference(subsumption_resolution,[],[f614,f324]) ).
fof(f614,plain,
( nil = sK15
| ~ spl20_1
| spl20_9 ),
inference(subsumption_resolution,[],[f610,f329]) ).
fof(f610,plain,
( ~ ssList(sK15)
| nil = sK15
| ~ spl20_1
| spl20_9 ),
inference(resolution,[],[f609,f241]) ).
fof(f609,plain,
( ~ ssItem(sK2(sK15))
| ~ spl20_1
| spl20_9 ),
inference(subsumption_resolution,[],[f605,f359]) ).
fof(f605,plain,
( ~ ssList(nil)
| ~ ssItem(sK2(sK15))
| spl20_9 ),
inference(resolution,[],[f603,f282]) ).
fof(f282,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f603,plain,
( ~ ssList(cons(sK2(sK15),nil))
| spl20_9 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f604,plain,
( spl20_8
| ~ spl20_9
| ~ spl20_1 ),
inference(avatar_split_clause,[],[f595,f358,f601,f597]) ).
fof(f595,plain,
( ~ ssList(cons(sK2(sK15),nil))
| ssItem(sK19(sK2(sK15),nil,sK1(sK15)))
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f594,f324]) ).
fof(f594,plain,
( ~ ssList(cons(sK2(sK15),nil))
| ssItem(sK19(sK2(sK15),nil,sK1(sK15)))
| nil = sK15
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f593,f329]) ).
fof(f593,plain,
( ssItem(sK19(sK2(sK15),nil,sK1(sK15)))
| ~ ssList(sK15)
| ~ ssList(cons(sK2(sK15),nil))
| nil = sK15
| ~ spl20_1 ),
inference(equality_resolution,[],[f566]) ).
fof(f566,plain,
( ! [X0] :
( sK15 != X0
| ~ ssList(cons(sK2(X0),nil))
| ssItem(sK19(sK2(X0),nil,sK1(X0)))
| nil = X0
| ~ ssList(X0) )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f565,f241]) ).
fof(f565,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(cons(sK2(X0),nil))
| ssItem(sK19(sK2(X0),nil,sK1(X0)))
| sK15 != X0
| nil = X0
| ~ ssItem(sK2(X0)) )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f563,f243]) ).
fof(f563,plain,
( ! [X0] :
( nil = X0
| ~ ssList(sK1(X0))
| ssItem(sK19(sK2(X0),nil,sK1(X0)))
| ~ ssList(cons(sK2(X0),nil))
| ~ ssItem(sK2(X0))
| ~ ssList(X0)
| sK15 != X0 )
| ~ spl20_1 ),
inference(superposition,[],[f553,f242]) ).
fof(f553,plain,
( ! [X8,X9] :
( cons(X8,X9) != sK15
| ~ ssItem(X8)
| ssItem(sK19(X8,nil,X9))
| ~ ssList(X9)
| ~ ssList(cons(X8,nil)) )
| ~ spl20_1 ),
inference(duplicate_literal_removal,[],[f536]) ).
fof(f536,plain,
( ! [X8,X9] :
( cons(X8,X9) != sK15
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssItem(X8)
| ssItem(sK19(X8,nil,X9))
| ~ ssList(cons(X8,nil))
| ~ ssList(X9) )
| ~ spl20_1 ),
inference(superposition,[],[f396,f293]) ).
fof(f396,plain,
( ! [X8,X9] :
( app(cons(X8,nil),X9) != sK15
| ~ ssList(X9)
| ~ ssList(cons(X8,nil))
| ssItem(sK19(X8,nil,X9))
| ~ ssItem(X8) )
| ~ spl20_1 ),
inference(subsumption_resolution,[],[f391,f359]) ).
fof(f391,plain,
! [X8,X9] :
( ~ ssList(nil)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK15
| ~ ssList(cons(X8,nil))
| ~ ssItem(X8)
| ssItem(sK19(X8,nil,X9)) ),
inference(superposition,[],[f322,f283]) ).
fof(f322,plain,
! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK15
| ~ ssList(X7)
| ~ ssItem(X5)
| ~ ssList(X6)
| ssItem(sK19(X5,X6,X7)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f365,plain,
spl20_1,
inference(avatar_split_clause,[],[f284,f358]) ).
fof(f284,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC249+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:47:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (28403)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.20/0.55 % (28402)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.20/0.56 % (28411)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.20/0.56 % (28419)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.20/0.56 % (28418)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.20/0.56 % (28410)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.20/0.57 % (28410)Instruction limit reached!
% 0.20/0.57 % (28410)------------------------------
% 0.20/0.57 % (28410)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (28410)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (28411)Instruction limit reached!
% 0.20/0.57 % (28411)------------------------------
% 0.20/0.57 % (28411)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (28410)Termination reason: Unknown
% 0.20/0.57 % (28410)Termination phase: shuffling
% 0.20/0.57
% 0.20/0.57 % (28410)Memory used [KB]: 1535
% 0.20/0.57 % (28410)Time elapsed: 0.004 s
% 0.20/0.57 % (28410)Instructions burned: 3 (million)
% 0.20/0.57 % (28410)------------------------------
% 0.20/0.57 % (28410)------------------------------
% 0.20/0.58 % (28399)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.20/0.58 % (28404)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.20/0.58 % (28411)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (28411)Termination reason: Unknown
% 0.20/0.58 % (28411)Termination phase: Function definition elimination
% 0.20/0.58
% 0.20/0.58 % (28411)Memory used [KB]: 1791
% 0.20/0.58 % (28411)Time elapsed: 0.009 s
% 0.20/0.58 % (28411)Instructions burned: 8 (million)
% 0.20/0.58 % (28411)------------------------------
% 0.20/0.58 % (28411)------------------------------
% 1.70/0.58 % (28421)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.70/0.58 % (28396)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.70/0.59 % (28402)First to succeed.
% 1.70/0.59 % (28409)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.70/0.59 % (28412)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)
% 1.70/0.59 % (28405)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)
% 1.70/0.59 % (28400)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)
% 1.70/0.59 % (28398)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)
% 1.70/0.59 % (28398)Instruction limit reached!
% 1.70/0.59 % (28398)------------------------------
% 1.70/0.59 % (28398)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.70/0.59 % (28398)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.70/0.59 % (28398)Termination reason: Unknown
% 1.70/0.59 % (28398)Termination phase: Preprocessing 3
% 1.70/0.59
% 1.70/0.59 % (28398)Memory used [KB]: 1663
% 1.70/0.59 % (28398)Time elapsed: 0.003 s
% 1.70/0.59 % (28398)Instructions burned: 4 (million)
% 1.70/0.59 % (28398)------------------------------
% 1.70/0.59 % (28398)------------------------------
% 1.70/0.59 % (28422)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.70/0.59 % (28401)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)
% 1.70/0.59 % (28406)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)
% 1.70/0.59 % (28424)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.70/0.59 % (28413)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.70/0.59 % (28407)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.85/0.60 % (28413)Instruction limit reached!
% 1.85/0.60 % (28413)------------------------------
% 1.85/0.60 % (28413)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.85/0.60 % (28413)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.85/0.60 % (28413)Termination reason: Unknown
% 1.85/0.60 % (28413)Termination phase: Preprocessing 3
% 1.85/0.60
% 1.85/0.60 % (28413)Memory used [KB]: 1663
% 1.85/0.60 % (28413)Time elapsed: 0.003 s
% 1.85/0.60 % (28413)Instructions burned: 4 (million)
% 1.85/0.60 % (28413)------------------------------
% 1.85/0.60 % (28413)------------------------------
% 1.85/0.60 % (28408)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)
% 1.85/0.60 % (28414)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)
% 1.85/0.60 % (28420)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.85/0.60 % (28417)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.85/0.60 % (28416)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.85/0.60 % (28414)Instruction limit reached!
% 1.85/0.60 % (28414)------------------------------
% 1.85/0.60 % (28414)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.85/0.60 % (28414)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.85/0.60 % (28414)Termination reason: Unknown
% 1.85/0.60 % (28414)Termination phase: Preprocessing 3
% 1.85/0.60
% 1.85/0.60 % (28414)Memory used [KB]: 1535
% 1.85/0.60 % (28414)Time elapsed: 0.005 s
% 1.85/0.60 % (28414)Instructions burned: 3 (million)
% 1.85/0.60 % (28414)------------------------------
% 1.85/0.60 % (28414)------------------------------
% 1.85/0.60 % (28397)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)
% 1.85/0.60 % (28425)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.85/0.60 % (28402)Refutation found. Thanks to Tanya!
% 1.85/0.60 % SZS status Theorem for theBenchmark
% 1.85/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.85/0.61 % (28402)------------------------------
% 1.85/0.61 % (28402)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.85/0.61 % (28402)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.85/0.61 % (28402)Termination reason: Refutation
% 1.85/0.61
% 1.85/0.61 % (28402)Memory used [KB]: 6396
% 1.85/0.61 % (28402)Time elapsed: 0.147 s
% 1.85/0.61 % (28402)Instructions burned: 19 (million)
% 1.85/0.61 % (28402)------------------------------
% 1.85/0.61 % (28402)------------------------------
% 1.85/0.61 % (28395)Success in time 0.246 s
%------------------------------------------------------------------------------