TSTP Solution File: SWC112+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC112+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:41:49 EDT 2022
% Result : Theorem 2.07s 0.61s
% Output : Refutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 81 ( 14 unt; 0 def)
% Number of atoms : 673 ( 205 equ)
% Maximal formula atoms : 62 ( 8 avg)
% Number of connectives : 962 ( 370 ~; 334 |; 222 &)
% ( 11 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 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 : 247 ( 171 !; 76 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f790,plain,
$false,
inference(avatar_sat_refutation,[],[f623,f633,f634,f635,f710,f714,f756,f789]) ).
fof(f789,plain,
( spl59_1
| ~ spl59_2
| ~ spl59_4 ),
inference(avatar_contradiction_clause,[],[f788]) ).
fof(f788,plain,
( $false
| spl59_1
| ~ spl59_2
| ~ spl59_4 ),
inference(unit_resulting_resolution,[],[f576,f614,f724,f396]) ).
fof(f396,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f251]) ).
fof(f251,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f163]) ).
fof(f163,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/benchmark/theBenchmark.p',ax58) ).
fof(f724,plain,
( segmentP(nil,sK10)
| ~ spl59_2
| ~ spl59_4 ),
inference(backward_demodulation,[],[f617,f627]) ).
fof(f627,plain,
( nil = sK13
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f625]) ).
fof(f625,plain,
( spl59_4
<=> nil = sK13 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_4])]) ).
fof(f617,plain,
( segmentP(sK13,sK10)
| ~ spl59_2 ),
inference(avatar_component_clause,[],[f616]) ).
fof(f616,plain,
( spl59_2
<=> segmentP(sK13,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_2])]) ).
fof(f614,plain,
( nil != sK10
| spl59_1 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f612,plain,
( spl59_1
<=> nil = sK10 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_1])]) ).
fof(f576,plain,
ssList(sK10),
inference(definition_unfolding,[],[f369,f377]) ).
fof(f377,plain,
sK12 = sK10,
inference(cnf_transformation,[],[f247]) ).
fof(f247,plain,
( ssList(sK11)
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK14
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(sK15)
& app(app(sK14,sK12),sK15) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != sK15 ) )
& ssList(sK14)
& sK12 = sK10
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = sK13
| nil != sK12 )
& sK11 = sK13
& ssList(sK13)
& ssList(sK12)
& ssList(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14,sK15])],[f151,f246,f245,f244,f243,f242,f241]) ).
fof(f241,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK10 = X2
& ( ( nil = X1
& nil != sK10 )
| ( ( ~ segmentP(X1,sK10)
| ~ neq(sK10,nil) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f242,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK10 = X2
& ( ( nil = X1
& nil != sK10 )
| ( ( ~ segmentP(X1,sK10)
| ~ neq(sK10,nil) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK11)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK10 = X2
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = X3
| nil != X2 )
& sK11 = X3
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f243,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK10 = X2
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = X3
| nil != X2 )
& sK11 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,sK12),X5) = X3
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK12 = sK10
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = X3
| nil != sK12 )
& sK11 = X3
& ssList(X3) )
& ssList(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f244,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,sK12),X5) = X3
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK12 = sK10
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = X3
| nil != sK12 )
& sK11 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,sK12),X5) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& sK12 = sK10
& ( ( nil = sK11
& nil != sK10 )
| ( ( ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) )
& neq(sK11,nil) ) )
& ( nil = sK13
| nil != sK12 )
& sK11 = sK13
& ssList(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,sK12),X5) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK14
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(sK14,sK12),X5) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f246,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK14
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(sK14,sK12),X5) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
=> ( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK14
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK12
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(sK15)
& app(app(sK14,sK12),sK15) = sK13
& strictorderedP(sK12)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK12
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != sK15 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ssList(X5)
& app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) ) )
& ssList(X4) )
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f150]) ).
fof(f150,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X1
& nil != X0 )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) )
| ~ ssItem(X6) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X5 ) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ( ( neq(X0,nil)
& segmentP(X1,X0) )
| ~ neq(X1,nil) ) )
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( app(cons(X10,nil),X11) = X5
& ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( lt(X12,X10)
& ssList(X13)
& app(X13,cons(X12,nil)) = X2 ) ) ) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ( ( neq(X0,nil)
& segmentP(X1,X0) )
| ~ neq(X1,nil) ) )
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( app(cons(X10,nil),X11) = X5
& ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( lt(X12,X10)
& ssList(X13)
& app(X13,cons(X12,nil)) = X2 ) ) ) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f369,plain,
ssList(sK12),
inference(cnf_transformation,[],[f247]) ).
fof(f756,plain,
( ~ spl59_1
| spl59_3
| ~ spl59_4
| ~ spl59_5 ),
inference(avatar_contradiction_clause,[],[f755]) ).
fof(f755,plain,
( $false
| ~ spl59_1
| spl59_3
| ~ spl59_4
| ~ spl59_5 ),
inference(subsumption_resolution,[],[f746,f725]) ).
fof(f725,plain,
( neq(nil,nil)
| ~ spl59_4
| ~ spl59_5 ),
inference(backward_demodulation,[],[f631,f627]) ).
fof(f631,plain,
( neq(sK13,nil)
| ~ spl59_5 ),
inference(avatar_component_clause,[],[f629]) ).
fof(f629,plain,
( spl59_5
<=> neq(sK13,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_5])]) ).
fof(f746,plain,
( ~ neq(nil,nil)
| ~ spl59_1
| spl59_3 ),
inference(backward_demodulation,[],[f622,f613]) ).
fof(f613,plain,
( nil = sK10
| ~ spl59_1 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f622,plain,
( ~ neq(sK10,nil)
| spl59_3 ),
inference(avatar_component_clause,[],[f620]) ).
fof(f620,plain,
( spl59_3
<=> neq(sK10,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_3])]) ).
fof(f714,plain,
( spl59_1
| spl59_3 ),
inference(avatar_contradiction_clause,[],[f713]) ).
fof(f713,plain,
( $false
| spl59_1
| spl59_3 ),
inference(unit_resulting_resolution,[],[f576,f549,f614,f622,f435]) ).
fof(f435,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f280]) ).
fof(f280,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f213]) ).
fof(f213,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != 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',ax15) ).
fof(f549,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f710,plain,
spl59_2,
inference(avatar_contradiction_clause,[],[f709]) ).
fof(f709,plain,
( $false
| spl59_2 ),
inference(subsumption_resolution,[],[f708,f576]) ).
fof(f708,plain,
( ~ ssList(sK10)
| spl59_2 ),
inference(subsumption_resolution,[],[f707,f378]) ).
fof(f378,plain,
ssList(sK14),
inference(cnf_transformation,[],[f247]) ).
fof(f707,plain,
( ~ ssList(sK14)
| ~ ssList(sK10)
| spl59_2 ),
inference(subsumption_resolution,[],[f706,f618]) ).
fof(f618,plain,
( ~ segmentP(sK13,sK10)
| spl59_2 ),
inference(avatar_component_clause,[],[f616]) ).
fof(f706,plain,
( segmentP(sK13,sK10)
| ~ ssList(sK14)
| ~ ssList(sK10) ),
inference(subsumption_resolution,[],[f705,f382]) ).
fof(f382,plain,
ssList(sK15),
inference(cnf_transformation,[],[f247]) ).
fof(f705,plain,
( ~ ssList(sK15)
| ~ ssList(sK14)
| segmentP(sK13,sK10)
| ~ ssList(sK10) ),
inference(subsumption_resolution,[],[f704,f566]) ).
fof(f566,plain,
ssList(sK13),
inference(definition_unfolding,[],[f384,f371]) ).
fof(f371,plain,
sK11 = sK13,
inference(cnf_transformation,[],[f247]) ).
fof(f384,plain,
ssList(sK11),
inference(cnf_transformation,[],[f247]) ).
fof(f704,plain,
( ~ ssList(sK13)
| ~ ssList(sK10)
| ~ ssList(sK15)
| ~ ssList(sK14)
| segmentP(sK13,sK10) ),
inference(superposition,[],[f590,f568]) ).
fof(f568,plain,
sK13 = app(app(sK14,sK10),sK15),
inference(definition_unfolding,[],[f381,f377]) ).
fof(f381,plain,
app(app(sK14,sK12),sK15) = sK13,
inference(cnf_transformation,[],[f247]) ).
fof(f590,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f455]) ).
fof(f455,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f295]) ).
fof(f295,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK34(X0,X1))
& ssList(sK35(X0,X1))
& app(app(sK34(X0,X1),X1),sK35(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK34,sK35])],[f292,f294,f293]) ).
fof(f293,plain,
! [X0,X1] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
=> ( ssList(sK34(X0,X1))
& ? [X5] :
( ssList(X5)
& app(app(sK34(X0,X1),X1),X5) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f294,plain,
! [X0,X1] :
( ? [X5] :
( ssList(X5)
& app(app(sK34(X0,X1),X1),X5) = X0 )
=> ( ssList(sK35(X0,X1))
& app(app(sK34(X0,X1),X1),sK35(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(rectify,[],[f291]) ).
fof(f291,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f635,plain,
( ~ spl59_3
| ~ spl59_2
| spl59_4 ),
inference(avatar_split_clause,[],[f571,f625,f616,f620]) ).
fof(f571,plain,
( nil = sK13
| ~ segmentP(sK13,sK10)
| ~ neq(sK10,nil) ),
inference(definition_unfolding,[],[f376,f371,f371]) ).
fof(f376,plain,
( nil = sK11
| ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) ),
inference(cnf_transformation,[],[f247]) ).
fof(f634,plain,
( ~ spl59_1
| spl59_5 ),
inference(avatar_split_clause,[],[f574,f629,f612]) ).
fof(f574,plain,
( neq(sK13,nil)
| nil != sK10 ),
inference(definition_unfolding,[],[f373,f371]) ).
fof(f373,plain,
( nil != sK10
| neq(sK11,nil) ),
inference(cnf_transformation,[],[f247]) ).
fof(f633,plain,
( ~ spl59_1
| spl59_4 ),
inference(avatar_split_clause,[],[f575,f625,f612]) ).
fof(f575,plain,
( nil = sK13
| nil != sK10 ),
inference(definition_unfolding,[],[f372,f377]) ).
fof(f372,plain,
( nil = sK13
| nil != sK12 ),
inference(cnf_transformation,[],[f247]) ).
fof(f623,plain,
( ~ spl59_1
| ~ spl59_2
| ~ spl59_3 ),
inference(avatar_split_clause,[],[f573,f620,f616,f612]) ).
fof(f573,plain,
( ~ neq(sK10,nil)
| ~ segmentP(sK13,sK10)
| nil != sK10 ),
inference(definition_unfolding,[],[f374,f371]) ).
fof(f374,plain,
( nil != sK10
| ~ segmentP(sK11,sK10)
| ~ neq(sK10,nil) ),
inference(cnf_transformation,[],[f247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:27:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (23606)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (23614)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.52 % (23621)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.53 % (23613)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53 % (23626)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.53 % (23608)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (23622)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.53 % (23606)Instruction limit reached!
% 0.19/0.53 % (23606)------------------------------
% 0.19/0.53 % (23606)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (23606)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (23606)Termination reason: Unknown
% 0.19/0.53 % (23606)Termination phase: Function definition elimination
% 0.19/0.53
% 0.19/0.53 % (23606)Memory used [KB]: 1279
% 0.19/0.53 % (23606)Time elapsed: 0.008 s
% 0.19/0.53 % (23606)Instructions burned: 8 (million)
% 0.19/0.53 % (23606)------------------------------
% 0.19/0.53 % (23606)------------------------------
% 0.19/0.53 % (23628)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.53 % (23599)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.53 % (23625)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53 % (23603)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (23616)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.53 % (23602)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (23600)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53 % (23604)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.54 % (23605)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54 % (23624)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.54 % (23615)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54 % (23618)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54 % (23620)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.54 % (23619)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.54 % (23617)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54 % (23607)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.54 % (23609)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.55 % (23610)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.55 % (23611)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.55 % (23623)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.55 % (23601)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.55 % (23627)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.55 % (23612)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.57 % (23607)Instruction limit reached!
% 0.19/0.57 % (23607)------------------------------
% 0.19/0.57 % (23607)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (23607)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (23607)Termination reason: Unknown
% 0.19/0.57 % (23607)Termination phase: Naming
% 0.19/0.57
% 0.19/0.57 % (23607)Memory used [KB]: 1151
% 0.19/0.57 % (23607)Time elapsed: 0.003 s
% 0.19/0.57 % (23607)Instructions burned: 3 (million)
% 0.19/0.57 % (23607)------------------------------
% 0.19/0.57 % (23607)------------------------------
% 0.19/0.57 TRYING [1]
% 0.19/0.57 TRYING [2]
% 0.19/0.58 TRYING [1]
% 0.19/0.58 TRYING [2]
% 0.19/0.59 % (23600)First to succeed.
% 1.84/0.60 % (23605)Instruction limit reached!
% 1.84/0.60 % (23605)------------------------------
% 1.84/0.60 % (23605)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.60 % (23605)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.84/0.60 % (23605)Termination reason: Unknown
% 1.84/0.60 % (23605)Termination phase: Finite model building constraint generation
% 1.84/0.60
% 1.84/0.60 % (23605)Memory used [KB]: 7164
% 1.84/0.60 % (23605)Time elapsed: 0.129 s
% 1.84/0.60 % (23605)Instructions burned: 52 (million)
% 1.84/0.60 % (23605)------------------------------
% 1.84/0.60 % (23605)------------------------------
% 1.84/0.60 TRYING [1]
% 1.84/0.61 TRYING [2]
% 1.84/0.61 % (23601)Instruction limit reached!
% 1.84/0.61 % (23601)------------------------------
% 1.84/0.61 % (23601)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.61 % (23601)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.84/0.61 % (23601)Termination reason: Unknown
% 1.84/0.61 % (23601)Termination phase: Saturation
% 1.84/0.61
% 1.84/0.61 % (23601)Memory used [KB]: 1791
% 1.84/0.61 % (23601)Time elapsed: 0.186 s
% 1.84/0.61 % (23601)Instructions burned: 37 (million)
% 1.84/0.61 % (23601)------------------------------
% 1.84/0.61 % (23601)------------------------------
% 1.84/0.61 TRYING [3]
% 2.07/0.61 % (23600)Refutation found. Thanks to Tanya!
% 2.07/0.61 % SZS status Theorem for theBenchmark
% 2.07/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 2.07/0.61 % (23600)------------------------------
% 2.07/0.61 % (23600)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.07/0.61 % (23600)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.07/0.61 % (23600)Termination reason: Refutation
% 2.07/0.61
% 2.07/0.61 % (23600)Memory used [KB]: 6268
% 2.07/0.61 % (23600)Time elapsed: 0.187 s
% 2.07/0.61 % (23600)Instructions burned: 30 (million)
% 2.07/0.61 % (23600)------------------------------
% 2.07/0.61 % (23600)------------------------------
% 2.07/0.62 % (23598)Success in time 0.262 s
%------------------------------------------------------------------------------