TSTP Solution File: SWC231+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC231+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 : n022.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:39:46 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 21
% Syntax : Number of formulae : 86 ( 9 unt; 0 def)
% Number of atoms : 637 ( 133 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 857 ( 306 ~; 314 |; 206 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 210 ( 126 !; 84 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f502,plain,
$false,
inference(avatar_sat_refutation,[],[f279,f285,f488,f494,f501]) ).
fof(f501,plain,
( spl14_1
| ~ spl14_7
| ~ spl14_14
| ~ spl14_15 ),
inference(avatar_contradiction_clause,[],[f500]) ).
fof(f500,plain,
( $false
| spl14_1
| ~ spl14_7
| ~ spl14_14
| ~ spl14_15 ),
inference(subsumption_resolution,[],[f499,f487]) ).
fof(f487,plain,
( ssItem(sK6(sK13(sK4),nil,sK12(sK4)))
| ~ spl14_15 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f485,plain,
( spl14_15
<=> ssItem(sK6(sK13(sK4),nil,sK12(sK4))) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_15])]) ).
fof(f499,plain,
( ~ ssItem(sK6(sK13(sK4),nil,sK12(sK4)))
| spl14_1
| ~ spl14_7
| ~ spl14_14 ),
inference(resolution,[],[f498,f211]) ).
fof(f211,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f498,plain,
( memberP(nil,sK6(sK13(sK4),nil,sK12(sK4)))
| spl14_1
| ~ spl14_7
| ~ spl14_14 ),
inference(subsumption_resolution,[],[f497,f482]) ).
fof(f482,plain,
( ssList(cons(sK13(sK4),nil))
| ~ spl14_14 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f481,plain,
( spl14_14
<=> ssList(cons(sK13(sK4),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_14])]) ).
fof(f497,plain,
( ~ ssList(cons(sK13(sK4),nil))
| memberP(nil,sK6(sK13(sK4),nil,sK12(sK4)))
| spl14_1
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f496,f193]) ).
fof(f193,plain,
ssList(sK4),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
( ssList(sK2)
& ssList(sK3)
& nil != sK2
& sK3 = sK5
& ssList(sK5)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ( ssItem(sK6(X4,X5,X6))
& leq(X4,sK6(X4,X5,X6))
& memberP(X5,sK6(X4,X5,X6))
& memberP(X6,sK6(X4,X5,X6))
& ~ lt(X4,sK6(X4,X5,X6)) )
| ~ ssList(X6) ) ) )
& sK2 = sK4
& ( nil = sK4
| ( ssList(sK8)
& ssList(sK9)
& ! [X11] :
( ~ memberP(sK9,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(sK8,X11) )
& app(app(sK8,cons(sK7,nil)),sK9) = sK4
& ssItem(sK7) ) )
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9])],[f125,f154,f153,f152,f151,f150,f149,f148,f147]) ).
fof(f147,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != X0
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& X0 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) ) ) )
=> ( ssList(sK2)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != sK2
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != sK2
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) ) )
=> ( ssList(sK3)
& ? [X2] :
( ? [X3] :
( nil != sK2
& sK3 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X2] :
( ? [X3] :
( nil != sK2
& sK3 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( nil != sK2
& sK3 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = sK4
& ( nil = sK4
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK4 ) )
& ssItem(X8) ) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X3] :
( nil != sK2
& sK3 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = sK4
& ( nil = sK4
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK4 ) )
& ssItem(X8) ) ) )
=> ( nil != sK2
& sK3 = sK5
& ssList(sK5)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& sK2 = sK4
& ( nil = sK4
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK4 ) )
& ssItem(X8) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X4,X5,X6] :
( ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
=> ( ssItem(sK6(X4,X5,X6))
& leq(X4,sK6(X4,X5,X6))
& memberP(X5,sK6(X4,X5,X6))
& memberP(X6,sK6(X4,X5,X6))
& ~ lt(X4,sK6(X4,X5,X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK4 ) )
& ssItem(X8) )
=> ( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(X9,X11) )
& app(app(X9,cons(sK7,nil)),X10) = sK4 ) )
& ssItem(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(X9,X11) )
& app(app(X9,cons(sK7,nil)),X10) = sK4 ) )
=> ( ssList(sK8)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(sK8,X11) )
& app(app(sK8,cons(sK7,nil)),X10) = sK4 ) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(sK8,X11) )
& app(app(sK8,cons(sK7,nil)),X10) = sK4 )
=> ( ssList(sK9)
& ! [X11] :
( ~ memberP(sK9,X11)
| ~ ssItem(X11)
| ~ leq(sK7,X11)
| leq(X11,sK7)
| ~ memberP(sK8,X11) )
& app(app(sK8,cons(sK7,nil)),sK9) = sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != X0
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( ssItem(X7)
& leq(X4,X7)
& memberP(X5,X7)
& memberP(X6,X7)
& ~ lt(X4,X7) )
| ~ ssList(X6) ) ) )
& X0 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ leq(X8,X11)
| leq(X11,X8)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) ) ) )
& ssList(X2) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| nil = X0
| X1 != X3
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X6,X7)
| lt(X4,X7)
| ~ ssItem(X7)
| ~ leq(X4,X7)
| ~ memberP(X5,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| ~ ssList(X3)
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| ? [X11] :
( ssItem(X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8) )
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| nil = X0
| X1 != X3
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X6,X7)
| lt(X4,X7)
| ~ ssItem(X7)
| ~ leq(X4,X7)
| ~ memberP(X5,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| ~ ssList(X3)
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| ? [X11] :
( ssItem(X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8) )
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f496,plain,
( ~ ssList(sK4)
| memberP(nil,sK6(sK13(sK4),nil,sK12(sK4)))
| ~ ssList(cons(sK13(sK4),nil))
| spl14_1
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f495,f244]) ).
fof(f244,plain,
( nil != sK4
| spl14_1 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f243,plain,
( spl14_1
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f495,plain,
( nil = sK4
| memberP(nil,sK6(sK13(sK4),nil,sK12(sK4)))
| ~ ssList(cons(sK13(sK4),nil))
| ~ ssList(sK4)
| ~ spl14_7 ),
inference(equality_resolution,[],[f467]) ).
fof(f467,plain,
( ! [X0] :
( sK4 != X0
| memberP(nil,sK6(sK13(X0),nil,sK12(X0)))
| ~ ssList(cons(sK13(X0),nil))
| ~ ssList(X0)
| nil = X0 )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f466,f225]) ).
fof(f225,plain,
! [X0] :
( ssList(sK12(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ( ssList(sK12(X0))
& ssItem(sK13(X0))
& cons(sK13(X0),sK12(X0)) = X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f120,f162,f161]) ).
fof(f161,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
=> ( ssList(sK12(X0))
& ? [X2] :
( ssItem(X2)
& cons(X2,sK12(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,sK12(X0)) = X0 )
=> ( ssItem(sK13(X0))
& cons(sK13(X0),sK12(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ),
inference(flattening,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f466,plain,
( ! [X0] :
( ~ ssList(sK12(X0))
| sK4 != X0
| ~ ssList(X0)
| ~ ssList(cons(sK13(X0),nil))
| memberP(nil,sK6(sK13(X0),nil,sK12(X0)))
| nil = X0 )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f465,f224]) ).
fof(f224,plain,
! [X0] :
( ssItem(sK13(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f465,plain,
( ! [X0] :
( ~ ssList(X0)
| memberP(nil,sK6(sK13(X0),nil,sK12(X0)))
| sK4 != X0
| ~ ssItem(sK13(X0))
| nil = X0
| ~ ssList(cons(sK13(X0),nil))
| ~ ssList(sK12(X0)) )
| ~ spl14_7 ),
inference(superposition,[],[f449,f223]) ).
fof(f223,plain,
! [X0] :
( cons(sK13(X0),sK12(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f163]) ).
fof(f449,plain,
( ! [X2,X3] :
( cons(X2,X3) != sK4
| memberP(nil,sK6(X2,nil,X3))
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssItem(X2) )
| ~ spl14_7 ),
inference(duplicate_literal_removal,[],[f432]) ).
fof(f432,plain,
( ! [X2,X3] :
( ~ ssList(X3)
| cons(X2,X3) != sK4
| ~ ssList(X3)
| memberP(nil,sK6(X2,nil,X3))
| ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ~ ssItem(X2) )
| ~ spl14_7 ),
inference(superposition,[],[f336,f212]) ).
fof(f212,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f336,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK4
| ~ ssItem(X4)
| memberP(nil,sK6(X4,nil,X5))
| ~ ssList(cons(X4,nil))
| ~ ssList(X5) )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f330,f272]) ).
fof(f272,plain,
( ssList(nil)
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f271,plain,
( spl14_7
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_7])]) ).
fof(f330,plain,
! [X4,X5] :
( ~ ssList(nil)
| ~ ssList(X5)
| ~ ssItem(X4)
| app(cons(X4,nil),X5) != sK4
| memberP(nil,sK6(X4,nil,X5))
| ~ ssList(cons(X4,nil)) ),
inference(superposition,[],[f231,f168]) ).
fof(f168,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f231,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK4
| memberP(X5,sK6(X4,X5,X6))
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f202,f199]) ).
fof(f199,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f155]) ).
fof(f202,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| app(app(X5,cons(X4,nil)),X6) != sK2
| memberP(X5,sK6(X4,X5,X6))
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f155]) ).
fof(f494,plain,
( spl14_1
| ~ spl14_7
| spl14_14 ),
inference(avatar_contradiction_clause,[],[f493]) ).
fof(f493,plain,
( $false
| spl14_1
| ~ spl14_7
| spl14_14 ),
inference(subsumption_resolution,[],[f492,f244]) ).
fof(f492,plain,
( nil = sK4
| ~ spl14_7
| spl14_14 ),
inference(subsumption_resolution,[],[f491,f193]) ).
fof(f491,plain,
( ~ ssList(sK4)
| nil = sK4
| ~ spl14_7
| spl14_14 ),
inference(resolution,[],[f490,f224]) ).
fof(f490,plain,
( ~ ssItem(sK13(sK4))
| ~ spl14_7
| spl14_14 ),
inference(subsumption_resolution,[],[f489,f272]) ).
fof(f489,plain,
( ~ ssItem(sK13(sK4))
| ~ ssList(nil)
| spl14_14 ),
inference(resolution,[],[f483,f166]) ).
fof(f166,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f483,plain,
( ~ ssList(cons(sK13(sK4),nil))
| spl14_14 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f488,plain,
( ~ spl14_14
| spl14_15
| spl14_1
| ~ spl14_7 ),
inference(avatar_split_clause,[],[f479,f271,f243,f485,f481]) ).
fof(f479,plain,
( ssItem(sK6(sK13(sK4),nil,sK12(sK4)))
| ~ ssList(cons(sK13(sK4),nil))
| spl14_1
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f478,f193]) ).
fof(f478,plain,
( ~ ssList(sK4)
| ssItem(sK6(sK13(sK4),nil,sK12(sK4)))
| ~ ssList(cons(sK13(sK4),nil))
| spl14_1
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f477,f244]) ).
fof(f477,plain,
( nil = sK4
| ~ ssList(cons(sK13(sK4),nil))
| ssItem(sK6(sK13(sK4),nil,sK12(sK4)))
| ~ ssList(sK4)
| ~ spl14_7 ),
inference(equality_resolution,[],[f464]) ).
fof(f464,plain,
( ! [X0] :
( sK4 != X0
| nil = X0
| ~ ssList(X0)
| ssItem(sK6(sK13(X0),nil,sK12(X0)))
| ~ ssList(cons(sK13(X0),nil)) )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f463,f224]) ).
fof(f463,plain,
( ! [X0] :
( nil = X0
| ssItem(sK6(sK13(X0),nil,sK12(X0)))
| ~ ssList(X0)
| sK4 != X0
| ~ ssItem(sK13(X0))
| ~ ssList(cons(sK13(X0),nil)) )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f462,f225]) ).
fof(f462,plain,
( ! [X0] :
( ~ ssList(cons(sK13(X0),nil))
| ~ ssList(X0)
| nil = X0
| ~ ssList(sK12(X0))
| ~ ssItem(sK13(X0))
| sK4 != X0
| ssItem(sK6(sK13(X0),nil,sK12(X0))) )
| ~ spl14_7 ),
inference(superposition,[],[f452,f223]) ).
fof(f452,plain,
( ! [X8,X9] :
( cons(X8,X9) != sK4
| ~ ssList(X9)
| ssItem(sK6(X8,nil,X9))
| ~ ssItem(X8)
| ~ ssList(cons(X8,nil)) )
| ~ spl14_7 ),
inference(duplicate_literal_removal,[],[f435]) ).
fof(f435,plain,
( ! [X8,X9] :
( ~ ssItem(X8)
| ~ ssList(cons(X8,nil))
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssList(X9)
| cons(X8,X9) != sK4
| ssItem(sK6(X8,nil,X9)) )
| ~ spl14_7 ),
inference(superposition,[],[f333,f212]) ).
fof(f333,plain,
( ! [X8,X9] :
( sK4 != app(cons(X8,nil),X9)
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssList(cons(X8,nil))
| ssItem(sK6(X8,nil,X9)) )
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f332,f272]) ).
fof(f332,plain,
! [X8,X9] :
( ~ ssList(cons(X8,nil))
| ssItem(sK6(X8,nil,X9))
| ~ ssItem(X8)
| ~ ssList(X9)
| sK4 != app(cons(X8,nil),X9)
| ~ ssList(nil) ),
inference(superposition,[],[f229,f168]) ).
fof(f229,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK4
| ~ ssList(X6)
| ssItem(sK6(X4,X5,X6))
| ~ ssItem(X4)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f204,f199]) ).
fof(f204,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| app(app(X5,cons(X4,nil)),X6) != sK2
| ssItem(sK6(X4,X5,X6))
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f155]) ).
fof(f285,plain,
spl14_7,
inference(avatar_split_clause,[],[f167,f271]) ).
fof(f167,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f279,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f228,f243]) ).
fof(f228,plain,
nil != sK4,
inference(definition_unfolding,[],[f207,f199]) ).
fof(f207,plain,
nil != sK2,
inference(cnf_transformation,[],[f155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC231+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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 : n022.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:38:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.55 % (31033)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.55 % (31031)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)
% 0.20/0.55 % (31032)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)
% 0.20/0.55 % (31048)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.20/0.55 % (31047)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)
% 0.20/0.56 % (31039)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)
% 0.20/0.56 % (31040)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56 % (31049)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56 % (31039)Instruction limit reached!
% 0.20/0.56 % (31039)------------------------------
% 0.20/0.56 % (31039)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (31041)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56 % (31031)First to succeed.
% 0.20/0.57 % (31040)Instruction limit reached!
% 0.20/0.57 % (31040)------------------------------
% 0.20/0.57 % (31040)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (31039)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (31039)Termination reason: Unknown
% 0.20/0.57 % (31039)Termination phase: Naming
% 0.20/0.57
% 0.20/0.57 % (31039)Memory used [KB]: 1535
% 0.20/0.57 % (31039)Time elapsed: 0.004 s
% 0.20/0.57 % (31039)Instructions burned: 3 (million)
% 0.20/0.57 % (31039)------------------------------
% 0.20/0.57 % (31039)------------------------------
% 0.20/0.58 % (31031)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (31031)------------------------------
% 0.20/0.58 % (31031)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (31031)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (31031)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (31031)Memory used [KB]: 6268
% 0.20/0.58 % (31031)Time elapsed: 0.133 s
% 0.20/0.58 % (31031)Instructions burned: 15 (million)
% 0.20/0.58 % (31031)------------------------------
% 0.20/0.58 % (31031)------------------------------
% 0.20/0.58 % (31024)Success in time 0.228 s
%------------------------------------------------------------------------------