TSTP Solution File: SWC067+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC067+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.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 May 1 03:59:33 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 92 ( 11 unt; 0 def)
% Number of atoms : 798 ( 217 equ)
% Maximal formula atoms : 66 ( 8 avg)
% Number of connectives : 1168 ( 462 ~; 416 |; 243 &)
% ( 10 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 305 ( 218 !; 87 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f625,plain,
$false,
inference(avatar_sat_refutation,[],[f307,f312,f317,f319,f426,f570,f624]) ).
fof(f624,plain,
( ~ spl18_1
| ~ spl18_2
| ~ spl18_3
| ~ spl18_4 ),
inference(avatar_contradiction_clause,[],[f623]) ).
fof(f623,plain,
( $false
| ~ spl18_1
| ~ spl18_2
| ~ spl18_3
| ~ spl18_4 ),
inference(subsumption_resolution,[],[f620,f599]) ).
fof(f599,plain,
( ~ neq(nil,nil)
| ~ spl18_1
| ~ spl18_2 ),
inference(superposition,[],[f550,f302]) ).
fof(f302,plain,
( nil = sK2
| ~ spl18_1 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f301,plain,
( spl18_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl18_1])]) ).
fof(f550,plain,
( ~ neq(sK2,nil)
| ~ spl18_2 ),
inference(subsumption_resolution,[],[f549,f196]) ).
fof(f196,plain,
ssList(sK2),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK5
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK4
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f162,f161,f160,f159,f158,f157]) ).
fof(f157,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& app(app(X5,sK2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& app(app(X5,sK2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& app(app(X5,sK2),X6) = sK3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& app(app(X5,sK2),X6) = sK3
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK4
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),X6)
& ssList(X6) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK4
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),X6)
& ssList(X6) )
=> ( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK5
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK4
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ lt(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ lt(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& strictorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& 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] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X9,X7)
& app(X10,cons(X9,nil)) = X2
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X11,X13)
& app(cons(X13,nil),X14) = X2
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X5
& ssList(X12) )
& ssItem(X11) )
| ~ strictorderedP(X2)
| app(app(X5,X2),X6) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X14] :
( segmentP(X0,X14)
& segmentP(X1,X14)
& neq(X14,nil)
& ssList(X14) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X14] :
( segmentP(X0,X14)
& segmentP(X1,X14)
& neq(X14,nil)
& ssList(X14) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',co1) ).
fof(f549,plain,
( ~ ssList(sK2)
| ~ neq(sK2,nil)
| ~ spl18_2 ),
inference(duplicate_literal_removal,[],[f545]) ).
fof(f545,plain,
( ~ ssList(sK2)
| ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ spl18_2 ),
inference(resolution,[],[f430,f242]) ).
fof(f242,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax55) ).
fof(f430,plain,
( ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl18_2 ),
inference(subsumption_resolution,[],[f306,f416]) ).
fof(f416,plain,
! [X0] :
( segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f415,f196]) ).
fof(f415,plain,
! [X0] :
( segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f414,f200]) ).
fof(f200,plain,
ssList(sK4),
inference(cnf_transformation,[],[f163]) ).
fof(f414,plain,
! [X0] :
( segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f335,f201]) ).
fof(f201,plain,
ssList(sK5),
inference(cnf_transformation,[],[f163]) ).
fof(f335,plain,
! [X0] :
( segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(superposition,[],[f241,f202]) ).
fof(f202,plain,
sK3 = app(app(sK4,sK2),sK5),
inference(cnf_transformation,[],[f163]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax56) ).
fof(f306,plain,
( ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK3,X4) )
| ~ spl18_2 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f305,plain,
( spl18_2
<=> ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).
fof(f620,plain,
( neq(nil,nil)
| ~ spl18_3
| ~ spl18_4 ),
inference(superposition,[],[f316,f311]) ).
fof(f311,plain,
( nil = sK3
| ~ spl18_3 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f309,plain,
( spl18_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl18_3])]) ).
fof(f316,plain,
( neq(sK3,nil)
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f314,plain,
( spl18_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_4])]) ).
fof(f570,plain,
( spl18_1
| ~ spl18_2 ),
inference(avatar_split_clause,[],[f569,f305,f301]) ).
fof(f569,plain,
( nil = sK2
| ~ spl18_2 ),
inference(subsumption_resolution,[],[f568,f196]) ).
fof(f568,plain,
( nil = sK2
| ~ ssList(sK2)
| ~ spl18_2 ),
inference(subsumption_resolution,[],[f553,f237]) ).
fof(f237,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax17) ).
fof(f553,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl18_2 ),
inference(resolution,[],[f550,f234]) ).
fof(f234,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax15) ).
fof(f426,plain,
( spl18_1
| ~ spl18_3 ),
inference(avatar_contradiction_clause,[],[f425]) ).
fof(f425,plain,
( $false
| spl18_1
| ~ spl18_3 ),
inference(subsumption_resolution,[],[f424,f196]) ).
fof(f424,plain,
( ~ ssList(sK2)
| spl18_1
| ~ spl18_3 ),
inference(subsumption_resolution,[],[f422,f303]) ).
fof(f303,plain,
( nil != sK2
| spl18_1 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f422,plain,
( nil = sK2
| ~ ssList(sK2)
| ~ spl18_3 ),
inference(resolution,[],[f413,f238]) ).
fof(f238,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax58) ).
fof(f413,plain,
( segmentP(nil,sK2)
| ~ spl18_3 ),
inference(forward_demodulation,[],[f412,f311]) ).
fof(f412,plain,
segmentP(sK3,sK2),
inference(subsumption_resolution,[],[f411,f197]) ).
fof(f197,plain,
ssList(sK3),
inference(cnf_transformation,[],[f163]) ).
fof(f411,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f410,f196]) ).
fof(f410,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f409,f200]) ).
fof(f409,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f334,f201]) ).
fof(f334,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f291,f202]) ).
fof(f291,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f248]) ).
fof(f248,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
fof(f179,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1))
& ssList(sK10(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f176,f178,f177]) ).
fof(f177,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f178,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f175]) ).
fof(f175,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588',ax7) ).
fof(f319,plain,
( spl18_3
| ~ spl18_1 ),
inference(avatar_split_clause,[],[f206,f301,f309]) ).
fof(f206,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f163]) ).
fof(f317,plain,
( ~ spl18_1
| spl18_4 ),
inference(avatar_split_clause,[],[f282,f314,f301]) ).
fof(f282,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f208,f198,f199]) ).
fof(f199,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f163]) ).
fof(f198,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f163]) ).
fof(f208,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f163]) ).
fof(f312,plain,
( spl18_3
| spl18_2 ),
inference(avatar_split_clause,[],[f281,f305,f309]) ).
fof(f281,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f209,f199,f198,f198]) ).
fof(f209,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f163]) ).
fof(f307,plain,
( ~ spl18_1
| spl18_2 ),
inference(avatar_split_clause,[],[f280,f305,f301]) ).
fof(f280,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK2 ),
inference(definition_unfolding,[],[f210,f199,f198,f199]) ).
fof(f210,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC067+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 18:38:10 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588
% 0.60/0.78 % (811)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.78 % (810)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.78 % (817)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.78 % (816)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.78 % (812)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.78 % (813)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.78 % (815)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.78 % (814)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.79 % (815)First to succeed.
% 0.60/0.80 % (810)Instruction limit reached!
% 0.60/0.80 % (810)------------------------------
% 0.60/0.80 % (810)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (810)Termination reason: Unknown
% 0.60/0.80 % (810)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (810)Memory used [KB]: 1472
% 0.60/0.80 % (810)Time elapsed: 0.023 s
% 0.60/0.80 % (810)Instructions burned: 34 (million)
% 0.60/0.80 % (810)------------------------------
% 0.60/0.80 % (810)------------------------------
% 0.60/0.80 % (815)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for Vampire---4
% 0.60/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80 % (815)------------------------------
% 0.60/0.80 % (815)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (815)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (815)Memory used [KB]: 1380
% 0.60/0.80 % (815)Time elapsed: 0.022 s
% 0.60/0.80 % (815)Instructions burned: 21 (million)
% 0.60/0.80 % (815)------------------------------
% 0.60/0.80 % (815)------------------------------
% 0.60/0.80 % (784)Success in time 0.42 s
% 0.60/0.80 terminate called after throwing an instance of 'Lib::SystemFailException'
% 0.60/0.80 784 Aborted by signal SIGABRT on /export/starexec/sandbox2/tmp/tmp.uf1c1UXLrX/Vampire---4.8_588
% 0.60/0.80 % (784)------------------------------
% 0.60/0.80 % (784)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (784)Termination reason: Unknown
% 0.60/0.80 % (784)Termination phase: Unknown
% 0.60/0.80
% 0.60/0.80 % (784)Memory used [KB]: 550
% 0.60/0.80 % (784)Time elapsed: 0.420 s
% 0.60/0.80 % (784)Instructions burned: 961 (million)
% 0.60/0.80 % (784)------------------------------
% 0.60/0.80 % (784)------------------------------
% 0.60/0.80 Version : Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 ???
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------