TSTP Solution File: SWC339+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC339+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 : n013.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:33 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 570 ( 172 equ)
% Maximal formula atoms : 56 ( 14 avg)
% Number of connectives : 851 ( 321 ~; 277 |; 223 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 12 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 263 ( 173 !; 90 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f349,plain,
$false,
inference(subsumption_resolution,[],[f348,f228]) ).
fof(f228,plain,
ssList(sK11),
inference(cnf_transformation,[],[f168]) ).
fof(f168,plain,
( ssList(sK8)
& ssList(sK9)
& ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK10 = sK8
& ssList(sK11)
& app(app(sK11,sK9),sK12) = sK10
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK11 ) )
& ssList(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != sK12 ) )
& totalorderedP(sK9)
& sK9 = sK7
& ssList(sK10)
& ( nil = sK10
| nil != sK9 )
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11,sK12])],[f161,f167,f166,f165,f164,f163,f162]) ).
fof(f162,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& X1 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& X0 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(X1,sK7) )
& X1 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& sK7 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(X1,sK7) )
& X1 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& sK7 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) )
=> ( ssList(sK8)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK8 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& sK7 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK8 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& sK7 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) )
=> ( ssList(sK9)
& ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK8 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK9),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) ) )
& sK9 = sK7
& ssList(X3)
& ( nil = X3
| nil != sK9 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
( ? [X3] :
( ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK8 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK9),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) ) )
& sK9 = sK7
& ssList(X3)
& ( nil = X3
| nil != sK9 ) )
=> ( ( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) )
& sK10 = sK8
& ? [X4] :
( ssList(X4)
& ? [X5] :
( sK10 = app(app(X4,sK9),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) ) )
& sK9 = sK7
& ssList(sK10)
& ( nil = sK10
| nil != sK9 ) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( sK10 = app(app(X4,sK9),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) ) )
=> ( ssList(sK11)
& ? [X5] :
( app(app(sK11,sK9),X5) = sK10
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK11 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f167,plain,
( ? [X5] :
( app(app(sK11,sK9),X5) = sK10
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK11 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(sK9) )
=> ( app(app(sK11,sK9),sK12) = sK10
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK9 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK11 ) )
& ssList(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != sK12 ) )
& totalorderedP(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& X1 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2 ) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ssList(X5)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) )
| app(cons(X10,nil),X11) != X5 ) )
& totalorderedP(X2) ) )
& X0 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(X0) ),
inference(rectify,[],[f138]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& X1 = X3
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 ) )
& ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) )
| app(cons(X6,nil),X7) != X5 ) )
& totalorderedP(X2) ) )
& X0 = X2
& ssList(X3)
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(X0) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( totalorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 ) )
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) )
| app(cons(X6,nil),X7) != X5 ) )
& ssList(X5) )
& ssList(X4) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& X0 = X2
& ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ~ totalorderedP(X2)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& leq(X10,X12)
& app(cons(X12,nil),X13) = X2 ) )
& app(X11,cons(X10,nil)) = X4 ) )
| app(app(X4,X2),X5) != X3
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X2
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) ) ) ) )
| X1 != X3
| ( nil = X2
& nil != X3 )
| X0 != X2
| ( totalorderedP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( app(cons(X10,nil),X11) = X5
& ssList(X11)
& ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) ) ) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) )
& ssList(X7) )
& ssItem(X6) ) ) ) )
| ( totalorderedP(X0)
& segmentP(X1,X0) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( app(cons(X10,nil),X11) = X5
& ssList(X11)
& ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) ) ) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) )
& ssList(X7) )
& ssItem(X6) ) ) ) )
| ( totalorderedP(X0)
& segmentP(X1,X0) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f348,plain,
~ ssList(sK11),
inference(subsumption_resolution,[],[f347,f232]) ).
fof(f232,plain,
ssList(sK8),
inference(cnf_transformation,[],[f168]) ).
fof(f347,plain,
( ~ ssList(sK8)
| ~ ssList(sK11) ),
inference(subsumption_resolution,[],[f346,f289]) ).
fof(f289,plain,
~ segmentP(sK8,sK7),
inference(subsumption_resolution,[],[f230,f254]) ).
fof(f254,plain,
totalorderedP(sK7),
inference(definition_unfolding,[],[f223,f222]) ).
fof(f222,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f168]) ).
fof(f223,plain,
totalorderedP(sK9),
inference(cnf_transformation,[],[f168]) ).
fof(f230,plain,
( ~ totalorderedP(sK7)
| ~ segmentP(sK8,sK7) ),
inference(cnf_transformation,[],[f168]) ).
fof(f346,plain,
( segmentP(sK8,sK7)
| ~ ssList(sK8)
| ~ ssList(sK11) ),
inference(subsumption_resolution,[],[f345,f219]) ).
fof(f219,plain,
ssList(sK7),
inference(cnf_transformation,[],[f168]) ).
fof(f345,plain,
( ~ ssList(sK7)
| ~ ssList(sK11)
| ~ ssList(sK8)
| segmentP(sK8,sK7) ),
inference(subsumption_resolution,[],[f332,f225]) ).
fof(f225,plain,
ssList(sK12),
inference(cnf_transformation,[],[f168]) ).
fof(f332,plain,
( ~ ssList(sK12)
| segmentP(sK8,sK7)
| ~ ssList(sK7)
| ~ ssList(sK11)
| ~ ssList(sK8) ),
inference(superposition,[],[f257,f251]) ).
fof(f251,plain,
sK8 = app(app(sK11,sK7),sK12),
inference(definition_unfolding,[],[f227,f222,f229]) ).
fof(f229,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f168]) ).
fof(f227,plain,
app(app(sK11,sK9),sK12) = sK10,
inference(cnf_transformation,[],[f168]) ).
fof(f257,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f196]) ).
fof(f196,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK3(X0,X1))
& ssList(sK4(X0,X1))
& app(app(sK3(X0,X1),X1),sK4(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f151,f153,f152]) ).
fof(f152,plain,
! [X0,X1] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
=> ( ssList(sK3(X0,X1))
& ? [X5] :
( ssList(X5)
& app(app(sK3(X0,X1),X1),X5) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
! [X0,X1] :
( ? [X5] :
( ssList(X5)
& app(app(sK3(X0,X1),X1),X5) = X0 )
=> ( ssList(sK4(X0,X1))
& app(app(sK3(X0,X1),X1),sK4(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f150]) ).
fof(f150,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC339+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 : n013.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:44:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.50 % (4975)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.50 % (4980)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.51 % (4992)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.51 % (4976)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.20/0.52 % (5001)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)
% 0.20/0.52 % (5001)Instruction limit reached!
% 0.20/0.52 % (5001)------------------------------
% 0.20/0.52 % (5001)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (4994)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)
% 0.20/0.52 % (4973)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.20/0.53 % (4996)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.53 % (4984)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.20/0.53 % (4977)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.20/0.53 % (5000)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.53 % (4973)Instruction limit reached!
% 0.20/0.53 % (4973)------------------------------
% 0.20/0.53 % (4973)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (4973)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (4973)Termination reason: Unknown
% 0.20/0.53 % (4973)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (4973)Memory used [KB]: 6396
% 0.20/0.53 % (4973)Time elapsed: 0.124 s
% 0.20/0.53 % (4973)Instructions burned: 14 (million)
% 0.20/0.53 % (4973)------------------------------
% 0.20/0.53 % (4973)------------------------------
% 0.20/0.53 % (4972)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.20/0.53 % (4999)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)
% 0.20/0.53 % (4992)Instruction limit reached!
% 0.20/0.53 % (4992)------------------------------
% 0.20/0.53 % (4992)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (4977)First to succeed.
% 0.20/0.53 % (5001)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (5001)Termination reason: Unknown
% 0.20/0.53 % (5001)Termination phase: Function definition elimination
% 0.20/0.53
% 0.20/0.53 % (4995)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.53 % (5001)Memory used [KB]: 1791
% 0.20/0.53 % (5001)Time elapsed: 0.007 s
% 0.20/0.53 % (5001)Instructions burned: 8 (million)
% 0.20/0.53 % (5001)------------------------------
% 0.20/0.53 % (5001)------------------------------
% 0.20/0.53 % (4974)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.20/0.53 % (4988)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.20/0.53 % (4974)Instruction limit reached!
% 0.20/0.53 % (4974)------------------------------
% 0.20/0.53 % (4974)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (4974)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (4974)Termination reason: Unknown
% 0.20/0.53 % (4974)Termination phase: Naming
% 0.20/0.53
% 0.20/0.53 % (4974)Memory used [KB]: 1535
% 0.20/0.53 % (4974)Time elapsed: 0.003 s
% 0.20/0.53 % (4974)Instructions burned: 3 (million)
% 0.20/0.53 % (4974)------------------------------
% 0.20/0.53 % (4974)------------------------------
% 0.20/0.54 % (5002)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)
% 0.20/0.54 % (4992)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (4992)Termination reason: Unknown
% 0.20/0.54 % (4992)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (4992)Memory used [KB]: 6396
% 0.20/0.54 % (4992)Time elapsed: 0.124 s
% 0.20/0.54 % (4992)Instructions burned: 12 (million)
% 0.20/0.54 % (4992)------------------------------
% 0.20/0.54 % (4992)------------------------------
% 0.20/0.54 % (4990)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (4976)Instruction limit reached!
% 0.20/0.54 % (4976)------------------------------
% 0.20/0.54 % (4976)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (4976)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (4976)Termination reason: Unknown
% 0.20/0.54 % (4976)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (4976)Memory used [KB]: 6268
% 0.20/0.54 % (4976)Time elapsed: 0.137 s
% 0.20/0.54 % (4976)Instructions burned: 13 (million)
% 0.20/0.54 % (4976)------------------------------
% 0.20/0.54 % (4976)------------------------------
% 0.20/0.54 % (4987)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.54 % (4986)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.54 % (4990)Instruction limit reached!
% 0.20/0.54 % (4990)------------------------------
% 0.20/0.54 % (4990)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (4990)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (4990)Termination reason: Unknown
% 0.20/0.54 % (4990)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (4990)Memory used [KB]: 1663
% 0.20/0.54 % (4990)Time elapsed: 0.003 s
% 0.20/0.54 % (4990)Instructions burned: 4 (million)
% 0.20/0.54 % (4990)------------------------------
% 0.20/0.54 % (4990)------------------------------
% 0.20/0.54 % (4986)Instruction limit reached!
% 0.20/0.54 % (4986)------------------------------
% 0.20/0.54 % (4986)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (4986)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (4986)Termination reason: Unknown
% 0.20/0.54 % (4986)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (4986)Memory used [KB]: 1663
% 0.20/0.54 % (4986)Time elapsed: 0.003 s
% 0.20/0.54 % (4986)Instructions burned: 4 (million)
% 0.20/0.54 % (4986)------------------------------
% 0.20/0.54 % (4986)------------------------------
% 0.20/0.54 % (4998)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)
% 0.20/0.54 % (4991)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.20/0.54 % (4991)Instruction limit reached!
% 0.20/0.54 % (4991)------------------------------
% 0.20/0.54 % (4991)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (4991)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (4991)Termination reason: Unknown
% 0.20/0.54 % (4991)Termination phase: SInE selection
% 0.20/0.54
% 0.20/0.54 % (4991)Memory used [KB]: 1407
% 0.20/0.54 % (4991)Time elapsed: 0.002 s
% 0.20/0.54 % (4991)Instructions burned: 2 (million)
% 0.20/0.54 % (4991)------------------------------
% 0.20/0.54 % (4991)------------------------------
% 0.20/0.54 % (4983)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)
% 0.20/0.54 % (4982)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.20/0.54 % (4997)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)
% 0.20/0.54 % (4993)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)
% 0.20/0.54 % (4979)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 % (4983)Instruction limit reached!
% 0.20/0.55 % (4983)------------------------------
% 0.20/0.55 % (4983)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (4983)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (4983)Termination reason: Unknown
% 0.20/0.55 % (4983)Termination phase: Saturation
% 0.20/0.55
% 0.20/0.55 % (4983)Memory used [KB]: 6140
% 0.20/0.55 % (4983)Time elapsed: 0.150 s
% 0.20/0.55 % (4983)Instructions burned: 8 (million)
% 0.20/0.55 % (4983)------------------------------
% 0.20/0.55 % (4983)------------------------------
% 0.20/0.55 % (4981)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.20/0.55 % (4984)Instruction limit reached!
% 0.20/0.55 % (4984)------------------------------
% 0.20/0.55 % (4984)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (4984)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (4984)Termination reason: Unknown
% 0.20/0.55 % (4984)Termination phase: Saturation
% 0.20/0.55
% 0.20/0.55 % (4984)Memory used [KB]: 2046
% 0.20/0.55 % (4984)Time elapsed: 0.138 s
% 0.20/0.55 % (4984)Instructions burned: 16 (million)
% 0.20/0.55 % (4984)------------------------------
% 0.20/0.55 % (4984)------------------------------
% 0.20/0.55 % (4985)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)
% 0.20/0.55 % (4978)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 % (4977)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (4977)------------------------------
% 0.20/0.56 % (4977)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (4977)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (4977)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (4977)Memory used [KB]: 1791
% 0.20/0.56 % (4977)Time elapsed: 0.124 s
% 0.20/0.56 % (4977)Instructions burned: 8 (million)
% 0.20/0.56 % (4977)------------------------------
% 0.20/0.56 % (4977)------------------------------
% 0.20/0.56 % (4971)Success in time 0.202 s
%------------------------------------------------------------------------------