TSTP Solution File: SWC112+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC112+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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:51 EDT 2024
% Result : Theorem 0.53s 0.76s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 82 ( 12 unt; 0 def)
% Number of atoms : 706 ( 219 equ)
% Maximal formula atoms : 62 ( 8 avg)
% Number of connectives : 1001 ( 377 ~; 345 |; 237 &)
% ( 11 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 261 ( 177 !; 84 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f473,plain,
$false,
inference(avatar_sat_refutation,[],[f312,f317,f322,f323,f324,f431,f435,f454,f472]) ).
fof(f472,plain,
( ~ spl18_1
| spl18_2
| ~ spl18_4
| ~ spl18_5 ),
inference(avatar_contradiction_clause,[],[f471]) ).
fof(f471,plain,
( $false
| ~ spl18_1
| spl18_2
| ~ spl18_4
| ~ spl18_5 ),
inference(subsumption_resolution,[],[f470,f456]) ).
fof(f456,plain,
( ~ neq(nil,nil)
| ~ spl18_1
| spl18_2 ),
inference(superposition,[],[f307,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(f307,plain,
( ~ neq(sK2,nil)
| spl18_2 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f305,plain,
( spl18_2
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).
fof(f470,plain,
( neq(nil,nil)
| ~ spl18_4
| ~ spl18_5 ),
inference(superposition,[],[f321,f316]) ).
fof(f316,plain,
( nil = sK3
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f314,plain,
( spl18_4
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl18_4])]) ).
fof(f321,plain,
( neq(sK3,nil)
| ~ spl18_5 ),
inference(avatar_component_clause,[],[f319]) ).
fof(f319,plain,
( spl18_5
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_5])]) ).
fof(f454,plain,
( spl18_1
| spl18_2 ),
inference(avatar_split_clause,[],[f453,f305,f301]) ).
fof(f453,plain,
( nil = sK2
| spl18_2 ),
inference(subsumption_resolution,[],[f452,f196]) ).
fof(f196,plain,
ssList(sK2),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& 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] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X3] :
( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& 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)
=> ( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X2
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X4
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ 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)
=> ( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ 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/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880',co1) ).
fof(f452,plain,
( nil = sK2
| ~ ssList(sK2)
| spl18_2 ),
inference(subsumption_resolution,[],[f437,f237]) ).
fof(f237,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880',ax17) ).
fof(f437,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl18_2 ),
inference(resolution,[],[f307,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/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880',ax15) ).
fof(f435,plain,
spl18_3,
inference(avatar_split_clause,[],[f417,f309]) ).
fof(f309,plain,
( spl18_3
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_3])]) ).
fof(f417,plain,
segmentP(sK3,sK2),
inference(subsumption_resolution,[],[f416,f197]) ).
fof(f197,plain,
ssList(sK3),
inference(cnf_transformation,[],[f163]) ).
fof(f416,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f415,f196]) ).
fof(f415,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f414,f200]) ).
fof(f200,plain,
ssList(sK4),
inference(cnf_transformation,[],[f163]) ).
fof(f414,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f339,f201]) ).
fof(f201,plain,
ssList(sK5),
inference(cnf_transformation,[],[f163]) ).
fof(f339,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f291,f202]) ).
fof(f202,plain,
sK3 = app(app(sK4,sK2),sK5),
inference(cnf_transformation,[],[f163]) ).
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/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880',ax7) ).
fof(f431,plain,
( spl18_1
| ~ spl18_4 ),
inference(avatar_contradiction_clause,[],[f430]) ).
fof(f430,plain,
( $false
| spl18_1
| ~ spl18_4 ),
inference(subsumption_resolution,[],[f429,f196]) ).
fof(f429,plain,
( ~ ssList(sK2)
| spl18_1
| ~ spl18_4 ),
inference(subsumption_resolution,[],[f427,f303]) ).
fof(f303,plain,
( nil != sK2
| spl18_1 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f427,plain,
( nil = sK2
| ~ ssList(sK2)
| ~ spl18_4 ),
inference(resolution,[],[f418,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/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880',ax58) ).
fof(f418,plain,
( segmentP(nil,sK2)
| ~ spl18_4 ),
inference(forward_demodulation,[],[f417,f316]) ).
fof(f324,plain,
( spl18_4
| ~ spl18_1 ),
inference(avatar_split_clause,[],[f206,f301,f314]) ).
fof(f206,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f163]) ).
fof(f323,plain,
( spl18_4
| spl18_5 ),
inference(avatar_split_clause,[],[f283,f319,f314]) ).
fof(f283,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f207,f198,f198]) ).
fof(f198,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f163]) ).
fof(f207,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f163]) ).
fof(f322,plain,
( ~ spl18_1
| spl18_5 ),
inference(avatar_split_clause,[],[f282,f319,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(f208,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f163]) ).
fof(f317,plain,
( spl18_4
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f281,f309,f305,f314]) ).
fof(f281,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f209,f198,f199,f199,f198]) ).
fof(f209,plain,
( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f163]) ).
fof(f312,plain,
( ~ spl18_1
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f280,f309,f305,f301]) ).
fof(f280,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f210,f198,f199,f199,f199]) ).
fof(f210,plain,
( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC112+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 18:21:27 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.4Ua3CmCR0l/Vampire---4.8_14880
% 0.53/0.74 % (15139)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 (2996ds/83Mi)
% 0.53/0.75 % (15133)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 (2996ds/34Mi)
% 0.53/0.75 % (15136)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.53/0.75 % (15135)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.53/0.75 % (15134)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 (2996ds/51Mi)
% 0.53/0.75 % (15137)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 (2996ds/34Mi)
% 0.53/0.75 % (15138)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.53/0.75 % (15140)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 (2996ds/56Mi)
% 0.53/0.75 % (15138)First to succeed.
% 0.53/0.76 % (15138)Refutation found. Thanks to Tanya!
% 0.53/0.76 % SZS status Theorem for Vampire---4
% 0.53/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.76 % (15138)------------------------------
% 0.53/0.76 % (15138)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.53/0.76 % (15138)Termination reason: Refutation
% 0.53/0.76
% 0.53/0.76 % (15138)Memory used [KB]: 1340
% 0.53/0.76 % (15138)Time elapsed: 0.010 s
% 0.53/0.76 % (15138)Instructions burned: 16 (million)
% 0.53/0.76 % (15138)------------------------------
% 0.53/0.76 % (15138)------------------------------
% 0.53/0.76 % (15129)Success in time 0.384 s
% 0.53/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------