TSTP Solution File: SWC092+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC092+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 : n027.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:44 EDT 2024
% Result : Theorem 0.71s 0.90s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 89 ( 15 unt; 0 def)
% Number of atoms : 562 ( 141 equ)
% Maximal formula atoms : 46 ( 6 avg)
% Number of connectives : 757 ( 284 ~; 255 |; 177 &)
% ( 10 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 201 ( 139 !; 62 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1512,plain,
$false,
inference(avatar_sat_refutation,[],[f353,f1092,f1326,f1494,f1511]) ).
fof(f1511,plain,
spl23_37,
inference(avatar_contradiction_clause,[],[f1510]) ).
fof(f1510,plain,
( $false
| spl23_37 ),
inference(subsumption_resolution,[],[f1509,f222]) ).
fof(f222,plain,
ssList(sK2),
inference(cnf_transformation,[],[f177]) ).
fof(f177,plain,
( ( nil != sK2
| nil = sK3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4)
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f176,f175,f174,f173,f172]) ).
fof(f172,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& neq(X1,nil)
& 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)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ? [X9] :
( segmentP(X0,X9)
& segmentP(X1,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [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) )
| ~ strictorderedP(X2)
| app(X2,X5) != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [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) )
| ~ strictorderedP(X2)
| app(X2,X5) != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yc0busR616/Vampire---4.8_12122',co1) ).
fof(f1509,plain,
( ~ ssList(sK2)
| spl23_37 ),
inference(resolution,[],[f1325,f264]) ).
fof(f264,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.yc0busR616/Vampire---4.8_12122',ax55) ).
fof(f1325,plain,
( ~ segmentP(sK2,sK2)
| spl23_37 ),
inference(avatar_component_clause,[],[f1323]) ).
fof(f1323,plain,
( spl23_37
<=> segmentP(sK2,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_37])]) ).
fof(f1494,plain,
( spl23_2
| spl23_36 ),
inference(avatar_contradiction_clause,[],[f1493]) ).
fof(f1493,plain,
( $false
| spl23_2
| spl23_36 ),
inference(subsumption_resolution,[],[f1492,f222]) ).
fof(f1492,plain,
( ~ ssList(sK2)
| spl23_2
| spl23_36 ),
inference(subsumption_resolution,[],[f1491,f259]) ).
fof(f259,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.yc0busR616/Vampire---4.8_12122',ax17) ).
fof(f1491,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| spl23_2
| spl23_36 ),
inference(subsumption_resolution,[],[f1484,f352]) ).
fof(f352,plain,
( nil != sK2
| spl23_2 ),
inference(avatar_component_clause,[],[f350]) ).
fof(f350,plain,
( spl23_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_2])]) ).
fof(f1484,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl23_36 ),
inference(resolution,[],[f1321,f256]) ).
fof(f256,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f186]) ).
fof(f186,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.yc0busR616/Vampire---4.8_12122',ax15) ).
fof(f1321,plain,
( ~ neq(sK2,nil)
| spl23_36 ),
inference(avatar_component_clause,[],[f1319]) ).
fof(f1319,plain,
( spl23_36
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_36])]) ).
fof(f1326,plain,
( ~ spl23_36
| ~ spl23_37 ),
inference(avatar_split_clause,[],[f1317,f1323,f1319]) ).
fof(f1317,plain,
( ~ segmentP(sK2,sK2)
| ~ neq(sK2,nil) ),
inference(subsumption_resolution,[],[f1312,f222]) ).
fof(f1312,plain,
( ~ segmentP(sK2,sK2)
| ~ neq(sK2,nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f1310,f324]) ).
fof(f324,plain,
! [X9] :
( ~ segmentP(sK3,X9)
| ~ segmentP(sK2,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f227,f225,f224]) ).
fof(f224,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f177]) ).
fof(f225,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f177]) ).
fof(f227,plain,
! [X9] :
( ~ segmentP(sK0,X9)
| ~ segmentP(sK1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f177]) ).
fof(f1310,plain,
segmentP(sK3,sK2),
inference(subsumption_resolution,[],[f1309,f228]) ).
fof(f228,plain,
ssList(sK4),
inference(cnf_transformation,[],[f177]) ).
fof(f1309,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4) ),
inference(subsumption_resolution,[],[f1292,f222]) ).
fof(f1292,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK4) ),
inference(superposition,[],[f895,f229]) ).
fof(f229,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f177]) ).
fof(f895,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f894,f254]) ).
fof(f254,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yc0busR616/Vampire---4.8_12122',ax26) ).
fof(f894,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f888,f259]) ).
fof(f888,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f881]) ).
fof(f881,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f333,f252]) ).
fof(f252,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.yc0busR616/Vampire---4.8_12122',ax28) ).
fof(f333,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f270]) ).
fof(f270,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,[],[f193]) ).
fof(f193,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f190,f192,f191]) ).
fof(f191,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f192,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f190,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,[],[f189]) ).
fof(f189,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.yc0busR616/Vampire---4.8_12122',ax7) ).
fof(f1092,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(avatar_contradiction_clause,[],[f1091]) ).
fof(f1091,plain,
( $false
| ~ spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f1075,f354]) ).
fof(f354,plain,
segmentP(nil,nil),
inference(subsumption_resolution,[],[f332,f259]) ).
fof(f332,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f261]) ).
fof(f261,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f188,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.yc0busR616/Vampire---4.8_12122',ax58) ).
fof(f1075,plain,
( ~ segmentP(nil,nil)
| ~ spl23_1
| ~ spl23_2 ),
inference(backward_demodulation,[],[f1054,f348]) ).
fof(f348,plain,
( nil = sK3
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f346]) ).
fof(f346,plain,
( spl23_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f1054,plain,
( ~ segmentP(nil,sK3)
| ~ spl23_2 ),
inference(backward_demodulation,[],[f361,f351]) ).
fof(f351,plain,
( nil = sK2
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f350]) ).
fof(f361,plain,
~ segmentP(sK2,sK3),
inference(subsumption_resolution,[],[f360,f325]) ).
fof(f325,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f226,f224]) ).
fof(f226,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f177]) ).
fof(f360,plain,
( ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(subsumption_resolution,[],[f359,f223]) ).
fof(f223,plain,
ssList(sK3),
inference(cnf_transformation,[],[f177]) ).
fof(f359,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f358]) ).
fof(f358,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil)
| ~ ssList(sK3) ),
inference(resolution,[],[f264,f324]) ).
fof(f353,plain,
( spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f232,f350,f346]) ).
fof(f232,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC092+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/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.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:48:33 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.yc0busR616/Vampire---4.8_12122
% 0.71/0.86 % (12341)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.71/0.86 % (12340)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.71/0.86 % (12338)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.71/0.86 % (12342)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.71/0.86 % (12339)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.71/0.86 % (12343)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.71/0.86 % (12344)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.71/0.86 % (12345)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.71/0.88 % (12341)Instruction limit reached!
% 0.71/0.88 % (12341)------------------------------
% 0.71/0.88 % (12341)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.88 % (12341)Termination reason: Unknown
% 0.71/0.88 % (12342)Instruction limit reached!
% 0.71/0.88 % (12342)------------------------------
% 0.71/0.88 % (12342)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.88 % (12341)Termination phase: Saturation
% 0.71/0.88
% 0.71/0.88 % (12341)Memory used [KB]: 1743
% 0.71/0.88 % (12341)Time elapsed: 0.020 s
% 0.71/0.88 % (12341)Instructions burned: 34 (million)
% 0.71/0.88 % (12341)------------------------------
% 0.71/0.88 % (12341)------------------------------
% 0.71/0.88 % (12342)Termination reason: Unknown
% 0.71/0.88 % (12342)Termination phase: Saturation
% 0.71/0.88
% 0.71/0.88 % (12342)Memory used [KB]: 2022
% 0.71/0.88 % (12342)Time elapsed: 0.020 s
% 0.71/0.88 % (12342)Instructions burned: 34 (million)
% 0.71/0.88 % (12342)------------------------------
% 0.71/0.88 % (12342)------------------------------
% 0.71/0.88 % (12338)Instruction limit reached!
% 0.71/0.88 % (12338)------------------------------
% 0.71/0.88 % (12338)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.88 % (12338)Termination reason: Unknown
% 0.71/0.88 % (12338)Termination phase: Saturation
% 0.71/0.88
% 0.71/0.88 % (12338)Memory used [KB]: 1476
% 0.71/0.88 % (12338)Time elapsed: 0.021 s
% 0.71/0.88 % (12338)Instructions burned: 35 (million)
% 0.71/0.88 % (12338)------------------------------
% 0.71/0.88 % (12338)------------------------------
% 0.71/0.88 % (12349)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2994ds/55Mi)
% 0.71/0.88 % (12350)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2994ds/50Mi)
% 0.71/0.88 % (12351)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/208Mi)
% 0.71/0.89 % (12343)Instruction limit reached!
% 0.71/0.89 % (12343)------------------------------
% 0.71/0.89 % (12343)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.89 % (12343)Termination reason: Unknown
% 0.71/0.89 % (12343)Termination phase: Saturation
% 0.71/0.89
% 0.71/0.89 % (12343)Memory used [KB]: 1560
% 0.71/0.89 % (12343)Time elapsed: 0.028 s
% 0.71/0.89 % (12343)Instructions burned: 45 (million)
% 0.71/0.89 % (12343)------------------------------
% 0.71/0.89 % (12343)------------------------------
% 0.71/0.89 % (12339)Instruction limit reached!
% 0.71/0.89 % (12339)------------------------------
% 0.71/0.89 % (12339)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.89 % (12339)Termination reason: Unknown
% 0.71/0.89 % (12339)Termination phase: Saturation
% 0.71/0.89
% 0.71/0.89 % (12339)Memory used [KB]: 2024
% 0.71/0.89 % (12339)Time elapsed: 0.031 s
% 0.71/0.89 % (12339)Instructions burned: 51 (million)
% 0.71/0.89 % (12339)------------------------------
% 0.71/0.89 % (12339)------------------------------
% 0.71/0.89 % (12352)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2994ds/52Mi)
% 0.71/0.89 % (12345)Instruction limit reached!
% 0.71/0.89 % (12345)------------------------------
% 0.71/0.89 % (12345)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.89 % (12345)Termination reason: Unknown
% 0.71/0.89 % (12345)Termination phase: Saturation
% 0.71/0.89
% 0.71/0.89 % (12345)Memory used [KB]: 1741
% 0.71/0.89 % (12345)Time elapsed: 0.031 s
% 0.71/0.89 % (12345)Instructions burned: 58 (million)
% 0.71/0.89 % (12345)------------------------------
% 0.71/0.89 % (12345)------------------------------
% 0.71/0.89 % (12355)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2994ds/518Mi)
% 0.71/0.89 % (12356)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on Vampire---4 for (2994ds/42Mi)
% 0.71/0.90 % (12340)First to succeed.
% 0.71/0.90 % (12340)Refutation found. Thanks to Tanya!
% 0.71/0.90 % SZS status Theorem for Vampire---4
% 0.71/0.90 % SZS output start Proof for Vampire---4
% See solution above
% 0.71/0.90 % (12340)------------------------------
% 0.71/0.90 % (12340)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.90 % (12340)Termination reason: Refutation
% 0.71/0.90
% 0.71/0.90 % (12340)Memory used [KB]: 1699
% 0.71/0.90 % (12340)Time elapsed: 0.044 s
% 0.71/0.90 % (12340)Instructions burned: 72 (million)
% 0.71/0.90 % (12340)------------------------------
% 0.71/0.90 % (12340)------------------------------
% 0.71/0.90 % (12304)Success in time 0.523 s
% 0.71/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------