TSTP Solution File: SWC112+1 by Vampire-SAT---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.9
% Problem : SWC112+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d SAT
% Computer : n028.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 : Mon Jun 24 16:40:52 EDT 2024
% Result : Theorem 2.64s 0.79s
% Output : Refutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 25
% Syntax : Number of formulae : 101 ( 15 unt; 0 def)
% Number of atoms : 770 ( 239 equ)
% Maximal formula atoms : 62 ( 7 avg)
% Number of connectives : 1081 ( 412 ~; 376 |; 242 &)
% ( 17 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 12 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 280 ( 196 !; 84 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6174,plain,
$false,
inference(avatar_sat_refutation,[],[f624,f629,f631,f1281,f1951,f1989,f2038,f2861,f2937,f3064,f3485,f6121,f6140]) ).
fof(f6140,plain,
( ~ spl59_35
| ~ spl59_31
| spl59_69
| ~ spl59_4 ),
inference(avatar_split_clause,[],[f6139,f621,f2979,f1957,f2044]) ).
fof(f2044,plain,
( spl59_35
<=> ssList(app(sK10,sK8)) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_35])]) ).
fof(f1957,plain,
( spl59_31
<=> ssList(sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_31])]) ).
fof(f2979,plain,
( spl59_69
<=> nil = app(sK10,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_69])]) ).
fof(f621,plain,
( spl59_4
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_4])]) ).
fof(f6139,plain,
( nil = app(sK10,sK8)
| ~ ssList(sK11)
| ~ ssList(app(sK10,sK8))
| ~ spl59_4 ),
inference(trivial_inequality_removal,[],[f6138]) ).
fof(f6138,plain,
( nil != nil
| nil = app(sK10,sK8)
| ~ ssList(sK11)
| ~ ssList(app(sK10,sK8))
| ~ spl59_4 ),
inference(forward_demodulation,[],[f1640,f623]) ).
fof(f623,plain,
( nil = sK9
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f621]) ).
fof(f1640,plain,
( nil != sK9
| nil = app(sK10,sK8)
| ~ ssList(sK11)
| ~ ssList(app(sK10,sK8)) ),
inference(superposition,[],[f550,f359]) ).
fof(f359,plain,
sK9 = app(app(sK10,sK8),sK11),
inference(cnf_transformation,[],[f239]) ).
fof(f239,plain,
( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( nil != sK8
| nil = sK9 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK11
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK10
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& sK9 = app(app(sK10,sK8),sK11)
& ssList(sK11)
& ssList(sK10)
& sK6 = sK8
& sK7 = sK9
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f100,f238,f237,f236,f235,f234,f233]) ).
fof(f233,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,sK6)
| ~ neq(sK6,nil) )
& neq(X1,nil) )
| ( nil != sK6
& 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) )
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f234,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,sK6)
| ~ neq(sK6,nil) )
& neq(X1,nil) )
| ( nil != sK6
& 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) )
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( 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) )
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f235,plain,
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( 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) )
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( nil != sK8
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& app(app(X4,sK8),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f236,plain,
( ? [X3] :
( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( nil != sK8
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& app(app(X4,sK8),X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
=> ( ( ( ( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil) )
& neq(sK7,nil) )
| ( nil != sK6
& nil = sK7 ) )
& ( nil != sK8
| nil = sK9 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& app(app(X4,sK8),X5) = sK9
& ssList(X5) )
& ssList(X4) )
& sK6 = sK8
& sK7 = sK9
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f237,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& app(app(X4,sK8),X5) = sK9
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK10
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& sK9 = app(app(sK10,sK8),X5)
& ssList(X5) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f238,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ 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) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK10
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& sK9 = app(app(sK10,sK8),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK8
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK11
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK10
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK8)
& sK9 = app(app(sK10,sK8),sK11)
& ssList(sK11) ) ),
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/benchmark/theBenchmark.p',unknown) ).
fof(f550,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f347]) ).
fof(f347,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f346]) ).
fof(f346,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f203]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f6121,plain,
( ~ spl59_29
| spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f6120,f612,f608,f1922]) ).
fof(f1922,plain,
( spl59_29
<=> ssList(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_29])]) ).
fof(f608,plain,
( spl59_1
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_1])]) ).
fof(f612,plain,
( spl59_2
<=> neq(sK8,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_2])]) ).
fof(f6120,plain,
( nil = sK8
| ~ ssList(sK8)
| spl59_2 ),
inference(resolution,[],[f1413,f614]) ).
fof(f614,plain,
( ~ neq(sK8,nil)
| spl59_2 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f1413,plain,
! [X0] :
( neq(X0,nil)
| nil = X0
| ~ ssList(X0) ),
inference(resolution,[],[f538,f376]) ).
fof(f376,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f538,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 = X1
| neq(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f332]) ).
fof(f332,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f199]) ).
fof(f199,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/benchmark/theBenchmark.p',unknown) ).
fof(f3485,plain,
( spl59_3
| ~ spl59_29
| ~ spl59_50
| ~ spl59_31
| ~ spl59_32 ),
inference(avatar_split_clause,[],[f3462,f1961,f1957,f2781,f1922,f616]) ).
fof(f616,plain,
( spl59_3
<=> segmentP(sK9,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_3])]) ).
fof(f2781,plain,
( spl59_50
<=> ssList(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_50])]) ).
fof(f1961,plain,
( spl59_32
<=> ssList(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_32])]) ).
fof(f3462,plain,
( ~ ssList(sK9)
| ~ ssList(sK11)
| ~ ssList(sK10)
| ~ ssList(sK8)
| segmentP(sK9,sK8) ),
inference(superposition,[],[f597,f359]) ).
fof(f597,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,[],[f548]) ).
fof(f548,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,[],[f345]) ).
fof(f345,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& ssList(sK56(X0,X1))
& ssList(sK55(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK55,sK56])],[f342,f344,f343]) ).
fof(f343,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK55(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK55(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& ssList(sK56(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f342,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,[],[f341]) ).
fof(f341,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,[],[f202]) ).
fof(f202,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/benchmark/theBenchmark.p',unknown) ).
fof(f3064,plain,
( ~ spl59_50
| ~ spl59_29
| spl59_1
| ~ spl59_69 ),
inference(avatar_split_clause,[],[f3063,f2979,f608,f1922,f2781]) ).
fof(f3063,plain,
( nil = sK8
| ~ ssList(sK8)
| ~ ssList(sK10)
| ~ spl59_69 ),
inference(trivial_inequality_removal,[],[f3054]) ).
fof(f3054,plain,
( nil != nil
| nil = sK8
| ~ ssList(sK8)
| ~ ssList(sK10)
| ~ spl59_69 ),
inference(superposition,[],[f549,f2981]) ).
fof(f2981,plain,
( nil = app(sK10,sK8)
| ~ spl59_69 ),
inference(avatar_component_clause,[],[f2979]) ).
fof(f549,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f347]) ).
fof(f2937,plain,
( ~ spl59_50
| ~ spl59_29
| spl59_35 ),
inference(avatar_split_clause,[],[f2936,f2044,f1922,f2781]) ).
fof(f2936,plain,
( ~ ssList(sK8)
| ~ ssList(sK10)
| spl59_35 ),
inference(resolution,[],[f2046,f530]) ).
fof(f530,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f186]) ).
fof(f186,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/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f2046,plain,
( ~ ssList(app(sK10,sK8))
| spl59_35 ),
inference(avatar_component_clause,[],[f2044]) ).
fof(f2861,plain,
spl59_50,
inference(avatar_contradiction_clause,[],[f2860]) ).
fof(f2860,plain,
( $false
| spl59_50 ),
inference(resolution,[],[f2783,f357]) ).
fof(f357,plain,
ssList(sK10),
inference(cnf_transformation,[],[f239]) ).
fof(f2783,plain,
( ~ ssList(sK10)
| spl59_50 ),
inference(avatar_component_clause,[],[f2781]) ).
fof(f2038,plain,
spl59_32,
inference(avatar_contradiction_clause,[],[f2037]) ).
fof(f2037,plain,
( $false
| spl59_32 ),
inference(resolution,[],[f1963,f354]) ).
fof(f354,plain,
ssList(sK9),
inference(cnf_transformation,[],[f239]) ).
fof(f1963,plain,
( ~ ssList(sK9)
| spl59_32 ),
inference(avatar_component_clause,[],[f1961]) ).
fof(f1989,plain,
spl59_31,
inference(avatar_contradiction_clause,[],[f1988]) ).
fof(f1988,plain,
( $false
| spl59_31 ),
inference(resolution,[],[f1959,f358]) ).
fof(f358,plain,
ssList(sK11),
inference(cnf_transformation,[],[f239]) ).
fof(f1959,plain,
( ~ ssList(sK11)
| spl59_31 ),
inference(avatar_component_clause,[],[f1957]) ).
fof(f1951,plain,
spl59_29,
inference(avatar_contradiction_clause,[],[f1950]) ).
fof(f1950,plain,
( $false
| spl59_29 ),
inference(resolution,[],[f1924,f353]) ).
fof(f353,plain,
ssList(sK8),
inference(cnf_transformation,[],[f239]) ).
fof(f1924,plain,
( ~ ssList(sK8)
| spl59_29 ),
inference(avatar_component_clause,[],[f1922]) ).
fof(f1281,plain,
( ~ spl59_4
| ~ spl59_5 ),
inference(avatar_contradiction_clause,[],[f1280]) ).
fof(f1280,plain,
( $false
| ~ spl59_4
| ~ spl59_5 ),
inference(resolution,[],[f1264,f702]) ).
fof(f702,plain,
~ neq(nil,nil),
inference(resolution,[],[f601,f376]) ).
fof(f601,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(duplicate_literal_removal,[],[f594]) ).
fof(f594,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f537]) ).
fof(f537,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f332]) ).
fof(f1264,plain,
( neq(nil,nil)
| ~ spl59_4
| ~ spl59_5 ),
inference(forward_demodulation,[],[f628,f623]) ).
fof(f628,plain,
( neq(sK9,nil)
| ~ spl59_5 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f626,plain,
( spl59_5
<=> neq(sK9,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_5])]) ).
fof(f631,plain,
( spl59_4
| ~ spl59_1 ),
inference(avatar_split_clause,[],[f363,f608,f621]) ).
fof(f363,plain,
( nil != sK8
| nil = sK9 ),
inference(cnf_transformation,[],[f239]) ).
fof(f629,plain,
( ~ spl59_1
| spl59_5 ),
inference(avatar_split_clause,[],[f569,f626,f608]) ).
fof(f569,plain,
( neq(sK9,nil)
| nil != sK8 ),
inference(definition_unfolding,[],[f365,f355,f356]) ).
fof(f356,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f239]) ).
fof(f355,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f239]) ).
fof(f365,plain,
( neq(sK7,nil)
| nil != sK6 ),
inference(cnf_transformation,[],[f239]) ).
fof(f624,plain,
( spl59_4
| ~ spl59_2
| ~ spl59_3 ),
inference(avatar_split_clause,[],[f568,f616,f612,f621]) ).
fof(f568,plain,
( ~ segmentP(sK9,sK8)
| ~ neq(sK8,nil)
| nil = sK9 ),
inference(definition_unfolding,[],[f366,f355,f356,f356,f355]) ).
fof(f366,plain,
( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil)
| nil = sK7 ),
inference(cnf_transformation,[],[f239]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC112+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.10 % Command : run_vampire %s %d SAT
% 0.09/0.29 % Computer : n028.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu Jun 20 04:52:38 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.31 Running first-order model finding
% 0.09/0.31 Running /export/starexec/sandbox/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.36 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36 % (25707)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.15/0.37 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (25705)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.15/0.37 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (25706)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.15/0.38 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (25704)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.15/0.39 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (25702)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.15/0.42 % (25707)Instruction limit reached!
% 0.15/0.42 % (25707)------------------------------
% 0.15/0.42 % (25707)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.15/0.42 % (25707)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.15/0.42 % (25707)Termination reason: Time limit
% 0.15/0.42 % (25707)Termination phase: Saturation
% 0.15/0.42
% 0.15/0.42 % (25707)Memory used [KB]: 3204
% 0.15/0.42 % (25707)Time elapsed: 0.056 s
% 0.15/0.42 % (25707)Instructions burned: 115 (million)
% 0.15/0.42 % (25705)Instruction limit reached!
% 0.15/0.42 % (25705)------------------------------
% 0.15/0.42 % (25705)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.15/0.42 % (25705)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.15/0.42 % (25705)Termination reason: Time limit
% 0.15/0.42 % (25705)Termination phase: Saturation
% 0.15/0.42
% 0.15/0.42 % (25705)Memory used [KB]: 1644
% 0.15/0.42 % (25705)Time elapsed: 0.054 s
% 0.15/0.42 % (25705)Instructions burned: 104 (million)
% 0.15/0.42 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.42 % (25701)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.15/0.43 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.43 % (25703)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.15/0.45 % (25706)Instruction limit reached!
% 0.15/0.45 % (25706)------------------------------
% 0.15/0.45 % (25706)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.15/0.45 % (25706)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.15/0.45 % (25706)Termination reason: Time limit
% 0.15/0.45 % (25706)Termination phase: Saturation
% 0.15/0.45
% 0.15/0.45 % (25706)Memory used [KB]: 2144
% 0.15/0.45 % (25706)Time elapsed: 0.079 s
% 0.15/0.45 % (25706)Instructions burned: 146 (million)
% 0.15/0.46 TRYING [1]
% 0.15/0.46 TRYING [2]
% 0.15/0.47 TRYING [3]
% 0.15/0.49 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.49 % (25709)ott-21_1:1_sil=4000:sp=const_frequency:i=175:fsr=off:fs=off:av=off_0 on theBenchmark for (2998ds/175Mi)
% 0.15/0.49 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.49 % (25708)dis+11_1:3_bsr=unit_only:sil=2000:rp=on:newcnf=on:i=404:kws=precedence:lsd=100_0 on theBenchmark for (2998ds/404Mi)
% 0.15/0.50 TRYING [10]
% 0.15/0.51 % (25700)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.51 % (25710)ott+33_1:1_to=lpo:sil=8000:sp=weighted_frequency:rp=on:i=270:nm=3:fsr=off:sac=on_0 on theBenchmark for (2998ds/270Mi)
% 0.15/0.51 TRYING [4]
% 1.67/0.59 % (25709)Instruction limit reached!
% 1.67/0.59 % (25709)------------------------------
% 1.67/0.59 % (25709)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.67/0.59 % (25709)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.67/0.59 % (25709)Termination reason: Time limit
% 1.67/0.59 % (25709)Termination phase: Saturation
% 1.67/0.59
% 1.67/0.59 % (25709)Memory used [KB]: 3967
% 1.67/0.59 % (25709)Time elapsed: 0.115 s
% 1.67/0.59 % (25709)Instructions burned: 176 (million)
% 1.67/0.62 TRYING [5]
% 2.05/0.66 % (25700)Running in auto input_syntax mode. Trying TPTP
% 2.05/0.66 % (25711)ott+4_1:1_sil=2000:i=900:bd=off:fsr=off_0 on theBenchmark for (2997ds/900Mi)
% 2.17/0.66 % (25710)Instruction limit reached!
% 2.17/0.66 % (25710)------------------------------
% 2.17/0.66 % (25710)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.17/0.66 % (25710)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.17/0.66 % (25710)Termination reason: Time limit
% 2.17/0.66 % (25710)Termination phase: Saturation
% 2.17/0.66
% 2.17/0.66 % (25710)Memory used [KB]: 4662
% 2.17/0.66 % (25710)Time elapsed: 0.155 s
% 2.17/0.66 % (25710)Instructions burned: 270 (million)
% 2.17/0.71 % (25708)Instruction limit reached!
% 2.17/0.71 % (25708)------------------------------
% 2.17/0.71 % (25708)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.17/0.71 % (25708)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.17/0.71 % (25708)Termination reason: Time limit
% 2.17/0.71 % (25708)Termination phase: Saturation
% 2.17/0.71
% 2.17/0.71 % (25708)Memory used [KB]: 5348
% 2.17/0.71 % (25708)Time elapsed: 0.220 s
% 2.17/0.71 % (25708)Instructions burned: 404 (million)
% 2.19/0.73 % (25700)Running in auto input_syntax mode. Trying TPTP
% 2.19/0.73 % (25712)fmb+10_1:1_sil=8000:fde=unused:fmbes=contour:i=7859:nm=2:fmbswr=0_0 on theBenchmark for (2996ds/7859Mi)
% 2.19/0.74 TRYING [1]
% 2.19/0.74 TRYING [2]
% 2.64/0.75 TRYING [3]
% 2.64/0.78 % (25700)Running in auto input_syntax mode. Trying TPTP
% 2.64/0.78 % (25713)ott+11_1:2_anc=none:sil=2000:sp=const_max:spb=units:s2a=on:i=2145:s2at=5.0:awrs=converge:awrsf=170:rawr=on:gs=on:fsr=off_0 on theBenchmark for (2996ds/2145Mi)
% 2.64/0.78 % (25711)First to succeed.
% 2.64/0.79 % (25711)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25700"
% 2.64/0.79 % (25700)Running in auto input_syntax mode. Trying TPTP
% 2.64/0.79 % (25711)Refutation found. Thanks to Tanya!
% 2.64/0.79 % SZS status Theorem for theBenchmark
% 2.64/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 2.64/0.79 % (25711)------------------------------
% 2.64/0.79 % (25711)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.64/0.79 % (25711)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.64/0.79 % (25711)Termination reason: Refutation
% 2.64/0.79
% 2.64/0.79 % (25711)Memory used [KB]: 4305
% 2.64/0.79 % (25711)Time elapsed: 0.129 s
% 2.64/0.79 % (25711)Instructions burned: 234 (million)
% 2.64/0.79 % (25711)------------------------------
% 2.64/0.79 % (25711)------------------------------
% 2.64/0.79 % (25700)Success in time 0.463 s
%------------------------------------------------------------------------------