TSTP Solution File: SWC076+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC076+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_uns --cores 0 -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 Aug 31 18:38:38 EDT 2022
% Result : Theorem 1.92s 0.61s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 15 unt; 0 def)
% Number of atoms : 565 ( 203 equ)
% Maximal formula atoms : 56 ( 10 avg)
% Number of connectives : 833 ( 321 ~; 263 |; 220 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 239 ( 159 !; 80 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f414,plain,
$false,
inference(unit_resulting_resolution,[],[f200,f219,f321,f407,f166]) ).
fof(f166,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 = X1
| neq(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f407,plain,
~ neq(sK8,nil),
inference(subsumption_resolution,[],[f406,f252]) ).
fof(f252,plain,
segmentP(sK8,sK8),
inference(resolution,[],[f200,f178]) ).
fof(f178,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f406,plain,
( ~ neq(sK8,nil)
| ~ segmentP(sK8,sK8) ),
inference(subsumption_resolution,[],[f399,f200]) ).
fof(f399,plain,
( ~ ssList(sK8)
| ~ neq(sK8,nil)
| ~ segmentP(sK8,sK8) ),
inference(resolution,[],[f345,f209]) ).
fof(f209,plain,
! [X4] :
( ~ segmentP(sK9,X4)
| ~ ssList(X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
( ssList(sK9)
& ssList(sK10)
& sK10 = sK8
& ( nil != sK10
| nil = sK11 )
& ssList(sK11)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK11 = sK9
& ( nil != sK8
| nil != sK9 )
& ssList(sK12)
& ssList(sK13)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != sK13
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(sK12,sK10),sK13) = sK11
& ! [X10] :
( ! [X11] :
( sK12 != app(X11,cons(X10,nil))
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10)
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13])],[f153,f159,f158,f157,f156,f155,f154]) ).
fof(f154,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X1 = X3
& ( nil != X0
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK8 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X1 = X3
& ( nil != sK8
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK8 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X1 = X3
& ( nil != sK8
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) ) )
=> ( ssList(sK9)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK8 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK9 = X3
& ( nil != sK8
| nil != sK9 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK8 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK9 = X3
& ( nil != sK8
| nil != sK9 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) )
=> ( ssList(sK10)
& ? [X3] :
( sK10 = sK8
& ( nil != sK10
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK9 = X3
& ( nil != sK8
| nil != sK9 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,sK10),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
( ? [X3] :
( sK10 = sK8
& ( nil != sK10
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK9 = X3
& ( nil != sK8
| nil != sK9 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,sK10),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) ) )
=> ( sK10 = sK8
& ( nil != sK10
| nil = sK11 )
& ssList(sK11)
& ! [X4] :
( ~ segmentP(sK9,X4)
| ~ segmentP(sK8,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK11 = sK9
& ( nil != sK8
| nil != sK9 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& sK11 = app(app(X5,sK10),X6)
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& sK11 = app(app(X5,sK10),X6)
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) )
=> ( ssList(sK12)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(sK12,sK10),X6) = sK11
& ! [X10] :
( ! [X11] :
( sK12 != app(X11,cons(X10,nil))
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(sK12,sK10),X6) = sK11
& ! [X10] :
( ! [X11] :
( sK12 != app(X11,cons(X10,nil))
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) )
=> ( ssList(sK13)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != sK13
| ! [X9] :
( sK10 != app(X9,cons(X7,nil))
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(sK12,sK10),sK13) = sK11
& ! [X10] :
( ! [X11] :
( sK12 != app(X11,cons(X10,nil))
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| sK10 != app(cons(X10,nil),X12) ) )
| ~ ssItem(X10) )
& equalelemsP(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X1 = X3
& ( nil != X0
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ! [X8] :
( app(cons(X7,nil),X8) != X6
| ! [X9] :
( app(X9,cons(X7,nil)) != X2
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X5
| ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X10,nil),X12) != X2 ) )
| ~ ssItem(X10) )
& equalelemsP(X2) ) ) ) ) )
& ssList(X0) ),
inference(rectify,[],[f131]) ).
fof(f131,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ssList(X3)
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X1 = X3
& ( nil != X0
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X10] :
( ! [X11] :
( app(cons(X10,nil),X11) != X6
| ! [X12] :
( app(X12,cons(X10,nil)) != X2
| ~ ssList(X12) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X5
| ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X7,nil),X9) != X2 ) )
| ~ ssItem(X7) )
& equalelemsP(X2) ) ) ) ) )
& ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ segmentP(X1,X4)
| ~ segmentP(X0,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ? [X5] :
( ? [X6] :
( equalelemsP(X2)
& ! [X10] :
( ! [X11] :
( app(cons(X10,nil),X11) != X6
| ! [X12] :
( app(X12,cons(X10,nil)) != X2
| ~ ssList(X12) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X5
| ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X7,nil),X9) != X2 ) )
| ~ ssItem(X7) )
& ssList(X6) )
& ssList(X5) )
& ( nil != X2
| nil = X3 )
& ( nil != X0
| nil != X1 )
& 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)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( neq(X4,nil)
& segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ~ equalelemsP(X2)
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X6
& ssList(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X2 ) )
& ssItem(X10) )
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X2 )
& app(X8,cons(X7,nil)) = X5 )
& ssItem(X7) ) ) ) )
| ( nil = X2
& nil != X3 )
| ( nil = X0
& nil = X1 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( neq(X4,nil)
& segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ~ equalelemsP(X2)
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X6
& ssList(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X2 ) )
& ssItem(X10) )
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X2 )
& app(X8,cons(X7,nil)) = X5 )
& ssItem(X7) ) ) ) )
| ( nil = X2
& nil != X3 )
| ( nil = X0
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f345,plain,
segmentP(sK9,sK8),
inference(subsumption_resolution,[],[f344,f214]) ).
fof(f214,plain,
ssList(sK9),
inference(cnf_transformation,[],[f160]) ).
fof(f344,plain,
( segmentP(sK9,sK8)
| ~ ssList(sK9) ),
inference(subsumption_resolution,[],[f343,f205]) ).
fof(f205,plain,
ssList(sK13),
inference(cnf_transformation,[],[f160]) ).
fof(f343,plain,
( ~ ssList(sK13)
| ~ ssList(sK9)
| segmentP(sK9,sK8) ),
inference(subsumption_resolution,[],[f342,f206]) ).
fof(f206,plain,
ssList(sK12),
inference(cnf_transformation,[],[f160]) ).
fof(f342,plain,
( ~ ssList(sK12)
| segmentP(sK9,sK8)
| ~ ssList(sK13)
| ~ ssList(sK9) ),
inference(subsumption_resolution,[],[f330,f200]) ).
fof(f330,plain,
( ~ ssList(sK8)
| ~ ssList(sK9)
| ~ ssList(sK12)
| ~ ssList(sK13)
| segmentP(sK9,sK8) ),
inference(superposition,[],[f239,f230]) ).
fof(f230,plain,
app(app(sK12,sK8),sK13) = sK9,
inference(definition_unfolding,[],[f203,f212,f208]) ).
fof(f208,plain,
sK11 = sK9,
inference(cnf_transformation,[],[f160]) ).
fof(f212,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f160]) ).
fof(f203,plain,
app(app(sK12,sK10),sK13) = sK11,
inference(cnf_transformation,[],[f160]) ).
fof(f239,plain,
! [X1,X4,X5] :
( ~ ssList(app(app(X4,X1),X5))
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssList(X5)
| segmentP(app(app(X4,X1),X5),X1) ),
inference(equality_resolution,[],[f196]) ).
fof(f196,plain,
! [X0,X1,X4,X5] :
( ~ ssList(X1)
| segmentP(X0,X1)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X4,X1),X5) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ( ssList(sK6(X0,X1))
& ssList(sK7(X0,X1))
& app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0 )
| ~ segmentP(X0,X1) )
& ( segmentP(X0,X1)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X4,X1),X5) != X0 ) ) ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f149,f151,f150]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
=> ( ssList(sK6(X0,X1))
& ? [X3] :
( ssList(X3)
& app(app(sK6(X0,X1),X1),X3) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0,X1] :
( ? [X3] :
( ssList(X3)
& app(app(sK6(X0,X1),X1),X3) = X0 )
=> ( ssList(sK7(X0,X1))
& app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) )
& ( segmentP(X0,X1)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X4,X1),X5) != X0 ) ) ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) )
& ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
<=> segmentP(X0,X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
<=> segmentP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f321,plain,
nil != sK8,
inference(subsumption_resolution,[],[f227,f207]) ).
fof(f207,plain,
( nil != sK9
| nil != sK8 ),
inference(cnf_transformation,[],[f160]) ).
fof(f227,plain,
( nil = sK9
| nil != sK8 ),
inference(definition_unfolding,[],[f211,f212,f208]) ).
fof(f211,plain,
( nil != sK10
| nil = sK11 ),
inference(cnf_transformation,[],[f160]) ).
fof(f219,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f200,plain,
ssList(sK8),
inference(cnf_transformation,[],[f160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC076+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:24:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (28842)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.55 % (28840)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.55 % (28830)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.56 % (28840)Instruction limit reached!
% 0.19/0.56 % (28840)------------------------------
% 0.19/0.56 % (28840)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (28850)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.57 % (28854)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.57 % (28850)Instruction limit reached!
% 0.19/0.57 % (28850)------------------------------
% 0.19/0.57 % (28850)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (28840)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (28840)Termination reason: Unknown
% 0.19/0.57 % (28840)Termination phase: Saturation
% 0.19/0.57
% 0.19/0.57 % (28840)Memory used [KB]: 6268
% 0.19/0.57 % (28840)Time elapsed: 0.147 s
% 0.19/0.57 % (28840)Instructions burned: 12 (million)
% 0.19/0.57 % (28840)------------------------------
% 0.19/0.57 % (28840)------------------------------
% 0.19/0.57 % (28842)Instruction limit reached!
% 0.19/0.57 % (28842)------------------------------
% 0.19/0.57 % (28842)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (28842)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (28842)Termination reason: Unknown
% 0.19/0.57 % (28842)Termination phase: Saturation
% 0.19/0.57
% 0.19/0.57 % (28842)Memory used [KB]: 2046
% 0.19/0.57 % (28842)Time elapsed: 0.156 s
% 0.19/0.57 % (28842)Instructions burned: 16 (million)
% 0.19/0.57 % (28842)------------------------------
% 0.19/0.57 % (28842)------------------------------
% 1.75/0.58 % (28850)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.75/0.58 % (28850)Termination reason: Unknown
% 1.75/0.58 % (28850)Termination phase: Saturation
% 1.75/0.58
% 1.75/0.58 % (28850)Memory used [KB]: 6268
% 1.75/0.58 % (28850)Time elapsed: 0.158 s
% 1.75/0.58 % (28850)Instructions burned: 11 (million)
% 1.75/0.58 % (28850)------------------------------
% 1.75/0.58 % (28850)------------------------------
% 1.75/0.58 % (28836)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.75/0.58 % (28832)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.75/0.58 % (28837)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.75/0.58 % (28834)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.75/0.58 % (28832)Instruction limit reached!
% 1.75/0.58 % (28832)------------------------------
% 1.75/0.58 % (28832)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.75/0.58 % (28832)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.75/0.58 % (28832)Termination reason: Unknown
% 1.75/0.58 % (28832)Termination phase: Preprocessing 3
% 1.75/0.58
% 1.75/0.58 % (28832)Memory used [KB]: 1663
% 1.75/0.58 % (28832)Time elapsed: 0.004 s
% 1.75/0.58 % (28832)Instructions burned: 3 (million)
% 1.75/0.58 % (28832)------------------------------
% 1.75/0.58 % (28832)------------------------------
% 1.75/0.58 % (28845)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.75/0.58 % (28844)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.75/0.58 % (28845)Instruction limit reached!
% 1.75/0.58 % (28845)------------------------------
% 1.75/0.58 % (28845)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.75/0.58 % (28845)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.75/0.58 % (28845)Termination reason: Unknown
% 1.75/0.58 % (28845)Termination phase: shuffling
% 1.75/0.58
% 1.75/0.58 % (28845)Memory used [KB]: 1535
% 1.75/0.58 % (28845)Time elapsed: 0.003 s
% 1.75/0.58 % (28845)Instructions burned: 3 (million)
% 1.75/0.58 % (28845)------------------------------
% 1.75/0.58 % (28845)------------------------------
% 1.75/0.59 % (28853)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.92/0.60 % (28856)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.92/0.60 % (28854)First to succeed.
% 1.92/0.60 % (28835)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.92/0.60 % (28833)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.92/0.61 % (28854)Refutation found. Thanks to Tanya!
% 1.92/0.61 % SZS status Theorem for theBenchmark
% 1.92/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.92/0.61 % (28854)------------------------------
% 1.92/0.61 % (28854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.92/0.61 % (28854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.92/0.61 % (28854)Termination reason: Refutation
% 1.92/0.61
% 1.92/0.61 % (28854)Memory used [KB]: 1918
% 1.92/0.61 % (28854)Time elapsed: 0.174 s
% 1.92/0.61 % (28854)Instructions burned: 14 (million)
% 1.92/0.61 % (28854)------------------------------
% 1.92/0.61 % (28854)------------------------------
% 1.92/0.61 % (28821)Success in time 0.254 s
%------------------------------------------------------------------------------