TSTP Solution File: SWC220+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC220+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_sat --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:42:28 EDT 2022
% Result : Theorem 1.68s 0.57s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 546 ( 109 equ)
% Maximal formula atoms : 52 ( 8 avg)
% Number of connectives : 749 ( 269 ~; 248 |; 208 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 183 ( 101 !; 82 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f749,plain,
$false,
inference(subsumption_resolution,[],[f748,f724]) ).
fof(f724,plain,
ssItem(sK14(sK15,sK16,sK17)),
inference(subsumption_resolution,[],[f723,f716]) ).
fof(f716,plain,
ssList(sK16),
inference(subsumption_resolution,[],[f384,f573]) ).
fof(f573,plain,
nil != sK12,
inference(definition_unfolding,[],[f379,f378]) ).
fof(f378,plain,
sK10 = sK12,
inference(cnf_transformation,[],[f251]) ).
fof(f251,plain,
( ssList(sK13)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ( memberP(X6,sK14(X4,X5,X6))
& memberP(X5,sK14(X4,X5,X6))
& leq(X4,sK14(X4,X5,X6))
& ~ leq(sK14(X4,X5,X6),X4)
& ssItem(sK14(X4,X5,X6)) ) )
| ~ ssList(X5) ) )
& ( ( ssItem(sK15)
& ssList(sK16)
& ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(sK16,X11)
| ~ memberP(sK17,X11) )
& ssList(sK17)
& sK12 = app(app(sK16,cons(sK15,nil)),sK17) )
| nil = sK12 )
& sK11 = sK13
& nil != sK10
& sK10 = sK12
& ssList(sK12)
& ssList(sK11)
& ssList(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17])],[f216,f250,f249,f248,f247,f246,f245,f244,f243]) ).
fof(f243,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& X1 = X3
& nil != X0
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& X1 = X3
& nil != sK10
& sK10 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f244,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& X1 = X3
& nil != sK10
& sK10 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& sK11 = X3
& nil != sK10
& sK10 = X2 )
& ssList(X2) )
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& sK11 = X3
& nil != sK10
& sK10 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = sK12 ) ) )
| nil = sK12 )
& sK11 = X3
& nil != sK10
& sK10 = sK12 )
& ssList(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f246,plain,
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = sK12 ) ) )
| nil = sK12 )
& sK11 = X3
& nil != sK10
& sK10 = sK12 )
=> ( ssList(sK13)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = sK12 ) ) )
| nil = sK12 )
& sK11 = sK13
& nil != sK10
& sK10 = sK12 ) ),
introduced(choice_axiom,[]) ).
fof(f247,plain,
! [X4,X5,X6] :
( ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) )
=> ( memberP(X6,sK14(X4,X5,X6))
& memberP(X5,sK14(X4,X5,X6))
& leq(X4,sK14(X4,X5,X6))
& ~ leq(sK14(X4,X5,X6),X4)
& ssItem(sK14(X4,X5,X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,plain,
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = sK12 ) ) )
=> ( ssItem(sK15)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(sK15,nil)),X10) = sK12 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f249,plain,
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(sK15,nil)),X10) = sK12 ) )
=> ( ssList(sK16)
& ? [X10] :
( ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(sK16,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(sK16,cons(sK15,nil)),X10) = sK12 ) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X10] :
( ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(sK16,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(sK16,cons(sK15,nil)),X10) = sK12 )
=> ( ! [X11] :
( ~ leq(sK15,X11)
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ memberP(sK16,X11)
| ~ memberP(sK17,X11) )
& ssList(sK17)
& sK12 = app(app(sK16,cons(sK15,nil)),sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f216,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6)
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 ) ) )
| nil = X2 )
& X1 = X3
& nil != X0
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f215]) ).
fof(f215,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X6,X7)
& memberP(X5,X7)
& ~ leq(X7,X4)
& leq(X4,X7)
& ssItem(X7) )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& nil != X0
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(app(X9,cons(X8,nil)),X10) = X2
& ! [X11] :
( ~ leq(X8,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11) )
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) ) )
& X1 = 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
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7) ) )
& ssList(X6) ) )
& ssItem(X4) )
| nil = X0
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ~ leq(X11,X8)
& memberP(X10,X11)
& memberP(X9,X11)
& leq(X8,X11)
& ssItem(X11) ) ) ) ) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7) ) )
& ssList(X6) ) )
& ssItem(X4) )
| nil = X0
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ~ leq(X11,X8)
& memberP(X10,X11)
& memberP(X9,X11)
& leq(X8,X11)
& ssItem(X11) ) ) ) ) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f379,plain,
nil != sK10,
inference(cnf_transformation,[],[f251]) ).
fof(f384,plain,
( nil = sK12
| ssList(sK16) ),
inference(cnf_transformation,[],[f251]) ).
fof(f723,plain,
( ~ ssList(sK16)
| ssItem(sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f722,f719]) ).
fof(f719,plain,
ssItem(sK15),
inference(subsumption_resolution,[],[f385,f573]) ).
fof(f385,plain,
( ssItem(sK15)
| nil = sK12 ),
inference(cnf_transformation,[],[f251]) ).
fof(f722,plain,
( ssItem(sK14(sK15,sK16,sK17))
| ~ ssItem(sK15)
| ~ ssList(sK16) ),
inference(subsumption_resolution,[],[f721,f717]) ).
fof(f717,plain,
ssList(sK17),
inference(subsumption_resolution,[],[f382,f573]) ).
fof(f382,plain,
( nil = sK12
| ssList(sK17) ),
inference(cnf_transformation,[],[f251]) ).
fof(f721,plain,
( ssItem(sK14(sK15,sK16,sK17))
| ~ ssList(sK17)
| ~ ssItem(sK15)
| ~ ssList(sK16) ),
inference(trivial_inequality_removal,[],[f720]) ).
fof(f720,plain,
( ~ ssItem(sK15)
| ssItem(sK14(sK15,sK16,sK17))
| sK12 != sK12
| ~ ssList(sK16)
| ~ ssList(sK17) ),
inference(superposition,[],[f572,f713]) ).
fof(f713,plain,
sK12 = app(app(sK16,cons(sK15,nil)),sK17),
inference(subsumption_resolution,[],[f381,f573]) ).
fof(f381,plain,
( sK12 = app(app(sK16,cons(sK15,nil)),sK17)
| nil = sK12 ),
inference(cnf_transformation,[],[f251]) ).
fof(f572,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK12
| ssItem(sK14(X4,X5,X6))
| ~ ssList(X6)
| ~ ssItem(X4)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f386,f378]) ).
fof(f386,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ssItem(sK14(X4,X5,X6))
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f251]) ).
fof(f748,plain,
~ ssItem(sK14(sK15,sK16,sK17)),
inference(subsumption_resolution,[],[f747,f734]) ).
fof(f734,plain,
memberP(sK16,sK14(sK15,sK16,sK17)),
inference(subsumption_resolution,[],[f733,f719]) ).
fof(f733,plain,
( ~ ssItem(sK15)
| memberP(sK16,sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f732,f716]) ).
fof(f732,plain,
( ~ ssList(sK16)
| memberP(sK16,sK14(sK15,sK16,sK17))
| ~ ssItem(sK15) ),
inference(subsumption_resolution,[],[f731,f717]) ).
fof(f731,plain,
( ~ ssList(sK17)
| ~ ssList(sK16)
| ~ ssItem(sK15)
| memberP(sK16,sK14(sK15,sK16,sK17)) ),
inference(trivial_inequality_removal,[],[f730]) ).
fof(f730,plain,
( memberP(sK16,sK14(sK15,sK16,sK17))
| sK12 != sK12
| ~ ssList(sK17)
| ~ ssList(sK16)
| ~ ssItem(sK15) ),
inference(superposition,[],[f569,f713]) ).
fof(f569,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK12
| ~ ssList(X5)
| memberP(X5,sK14(X4,X5,X6))
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f389,f378]) ).
fof(f389,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| memberP(X5,sK14(X4,X5,X6))
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f251]) ).
fof(f747,plain,
( ~ memberP(sK16,sK14(sK15,sK16,sK17))
| ~ ssItem(sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f746,f729]) ).
fof(f729,plain,
memberP(sK17,sK14(sK15,sK16,sK17)),
inference(subsumption_resolution,[],[f728,f717]) ).
fof(f728,plain,
( ~ ssList(sK17)
| memberP(sK17,sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f727,f716]) ).
fof(f727,plain,
( memberP(sK17,sK14(sK15,sK16,sK17))
| ~ ssList(sK16)
| ~ ssList(sK17) ),
inference(subsumption_resolution,[],[f726,f719]) ).
fof(f726,plain,
( ~ ssItem(sK15)
| ~ ssList(sK17)
| memberP(sK17,sK14(sK15,sK16,sK17))
| ~ ssList(sK16) ),
inference(trivial_inequality_removal,[],[f725]) ).
fof(f725,plain,
( ~ ssList(sK16)
| memberP(sK17,sK14(sK15,sK16,sK17))
| ~ ssItem(sK15)
| sK12 != sK12
| ~ ssList(sK17) ),
inference(superposition,[],[f568,f713]) ).
fof(f568,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK12
| ~ ssItem(X4)
| ~ ssList(X6)
| memberP(X6,sK14(X4,X5,X6))
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f390,f378]) ).
fof(f390,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| memberP(X6,sK14(X4,X5,X6))
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f251]) ).
fof(f746,plain,
( ~ memberP(sK17,sK14(sK15,sK16,sK17))
| ~ ssItem(sK14(sK15,sK16,sK17))
| ~ memberP(sK16,sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f745,f744]) ).
fof(f744,plain,
~ leq(sK14(sK15,sK16,sK17),sK15),
inference(subsumption_resolution,[],[f743,f719]) ).
fof(f743,plain,
( ~ ssItem(sK15)
| ~ leq(sK14(sK15,sK16,sK17),sK15) ),
inference(subsumption_resolution,[],[f742,f717]) ).
fof(f742,plain,
( ~ ssList(sK17)
| ~ leq(sK14(sK15,sK16,sK17),sK15)
| ~ ssItem(sK15) ),
inference(subsumption_resolution,[],[f741,f716]) ).
fof(f741,plain,
( ~ ssList(sK16)
| ~ leq(sK14(sK15,sK16,sK17),sK15)
| ~ ssItem(sK15)
| ~ ssList(sK17) ),
inference(trivial_inequality_removal,[],[f740]) ).
fof(f740,plain,
( ~ ssList(sK16)
| ~ ssList(sK17)
| ~ ssItem(sK15)
| ~ leq(sK14(sK15,sK16,sK17),sK15)
| sK12 != sK12 ),
inference(superposition,[],[f571,f713]) ).
fof(f571,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK12
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ leq(sK14(X4,X5,X6),X4)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f387,f378]) ).
fof(f387,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| ~ leq(sK14(X4,X5,X6),X4)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f251]) ).
fof(f745,plain,
( leq(sK14(sK15,sK16,sK17),sK15)
| ~ ssItem(sK14(sK15,sK16,sK17))
| ~ memberP(sK17,sK14(sK15,sK16,sK17))
| ~ memberP(sK16,sK14(sK15,sK16,sK17)) ),
inference(resolution,[],[f739,f715]) ).
fof(f715,plain,
! [X11] :
( ~ leq(sK15,X11)
| ~ memberP(sK17,X11)
| ~ memberP(sK16,X11)
| leq(X11,sK15)
| ~ ssItem(X11) ),
inference(subsumption_resolution,[],[f383,f573]) ).
fof(f383,plain,
! [X11] :
( nil = sK12
| leq(X11,sK15)
| ~ ssItem(X11)
| ~ leq(sK15,X11)
| ~ memberP(sK16,X11)
| ~ memberP(sK17,X11) ),
inference(cnf_transformation,[],[f251]) ).
fof(f739,plain,
leq(sK15,sK14(sK15,sK16,sK17)),
inference(subsumption_resolution,[],[f738,f719]) ).
fof(f738,plain,
( ~ ssItem(sK15)
| leq(sK15,sK14(sK15,sK16,sK17)) ),
inference(subsumption_resolution,[],[f737,f716]) ).
fof(f737,plain,
( leq(sK15,sK14(sK15,sK16,sK17))
| ~ ssList(sK16)
| ~ ssItem(sK15) ),
inference(subsumption_resolution,[],[f736,f717]) ).
fof(f736,plain,
( ~ ssList(sK17)
| leq(sK15,sK14(sK15,sK16,sK17))
| ~ ssItem(sK15)
| ~ ssList(sK16) ),
inference(trivial_inequality_removal,[],[f735]) ).
fof(f735,plain,
( ~ ssItem(sK15)
| sK12 != sK12
| leq(sK15,sK14(sK15,sK16,sK17))
| ~ ssList(sK16)
| ~ ssList(sK17) ),
inference(superposition,[],[f570,f713]) ).
fof(f570,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK12
| ~ ssList(X6)
| leq(X4,sK14(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f388,f378]) ).
fof(f388,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| app(app(X5,cons(X4,nil)),X6) != sK10
| ~ ssList(X6)
| leq(X4,sK14(X4,X5,X6))
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC220+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:44:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (20518)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (20526)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.51 % (20516)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (20510)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (20527)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 % (20535)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.52 % (20539)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.52 % (20531)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.52 % (20519)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (20537)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.52 % (20522)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53 % (20529)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53 % (20512)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (20509)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.53 % (20511)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.53 % (20513)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (20520)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53 % (20530)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.53 % (20514)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.53 % (20517)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53 % (20515)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (20517)Instruction limit reached!
% 0.19/0.53 % (20517)------------------------------
% 0.19/0.53 % (20517)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (20517)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (20517)Termination reason: Unknown
% 0.19/0.53 % (20517)Termination phase: Preprocessing 3
% 0.19/0.53
% 0.19/0.53 % (20517)Memory used [KB]: 1151
% 0.19/0.53 % (20517)Time elapsed: 0.004 s
% 0.19/0.53 % (20517)Instructions burned: 3 (million)
% 0.19/0.53 % (20517)------------------------------
% 0.19/0.53 % (20517)------------------------------
% 0.19/0.53 % (20516)Instruction limit reached!
% 0.19/0.53 % (20516)------------------------------
% 0.19/0.53 % (20516)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (20516)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (20516)Termination reason: Unknown
% 0.19/0.53 % (20516)Termination phase: Equality resolution with deletion
% 0.19/0.53
% 0.19/0.53 % (20516)Memory used [KB]: 1279
% 0.19/0.53 % (20516)Time elapsed: 0.006 s
% 0.19/0.53 % (20516)Instructions burned: 9 (million)
% 0.19/0.53 % (20516)------------------------------
% 0.19/0.53 % (20516)------------------------------
% 0.19/0.53 % (20536)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.54 % (20533)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.54 % (20524)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.54 % (20532)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.54 % (20521)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.54 % (20534)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.54 % (20523)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.54 % (20538)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.55 % (20525)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.55 % (20529)First to succeed.
% 0.19/0.55 TRYING [1]
% 0.19/0.56 TRYING [1]
% 0.19/0.56 TRYING [2]
% 0.19/0.56 TRYING [2]
% 0.19/0.56 TRYING [1]
% 1.68/0.57 TRYING [2]
% 1.68/0.57 % (20529)Refutation found. Thanks to Tanya!
% 1.68/0.57 % SZS status Theorem for theBenchmark
% 1.68/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.68/0.57 % (20529)------------------------------
% 1.68/0.57 % (20529)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.68/0.57 % (20529)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.68/0.57 % (20529)Termination reason: Refutation
% 1.68/0.57
% 1.68/0.57 % (20529)Memory used [KB]: 1535
% 1.68/0.57 % (20529)Time elapsed: 0.160 s
% 1.68/0.57 % (20529)Instructions burned: 17 (million)
% 1.68/0.57 % (20529)------------------------------
% 1.68/0.57 % (20529)------------------------------
% 1.68/0.57 % (20508)Success in time 0.218 s
%------------------------------------------------------------------------------