TSTP Solution File: SWC211+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC211+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 : n011.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:37 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 100 ( 10 unt; 0 def)
% Number of atoms : 461 ( 171 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 564 ( 203 ~; 209 |; 116 &)
% ( 11 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 126 ( 88 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f346,plain,
$false,
inference(avatar_sat_refutation,[],[f192,f231,f291,f301,f310,f316,f341,f345]) ).
fof(f345,plain,
( spl8_4
| spl8_13 ),
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f344,plain,
( $false
| spl8_4
| spl8_13 ),
inference(subsumption_resolution,[],[f343,f200]) ).
fof(f200,plain,
( nil != sK5
| spl8_4 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f198,plain,
( spl8_4
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
fof(f343,plain,
( nil = sK5
| spl8_13 ),
inference(subsumption_resolution,[],[f342,f169]) ).
fof(f169,plain,
ssList(sK5),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& sK7 = sK5
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = sK6
| nil != sK7 )
& sK6 = sK4
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != sK7
| app(X5,cons(X4,nil)) = sK6 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f112,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& X0 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) ) ) )
=> ( ssList(sK4)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ~ neq(sK4,nil)
& ( nil = X2
| nil != X3 )
& sK4 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ~ neq(sK4,nil)
& ( nil = X2
| nil != X3 )
& sK4 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) ) )
=> ( ssList(sK5)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK5 = X3
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = X2
| nil != X3 )
& sK4 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK5 = X3
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = X2
| nil != X3 )
& sK4 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) )
=> ( ssList(sK6)
& ? [X3] :
( sK5 = X3
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = sK6
| nil != X3 )
& sK6 = sK4
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK6 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( sK5 = X3
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = sK6
| nil != X3 )
& sK6 = sK4
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK6 ) ) )
=> ( sK7 = sK5
& neq(sK5,nil)
& ~ neq(sK4,nil)
& ( nil = sK6
| nil != sK7 )
& sK6 = sK4
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != sK7
| app(X5,cons(X4,nil)) = sK6 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& X0 = X2
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) ) ) ) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2 ) )
& neq(X1,nil)
& ~ neq(X0,nil)
& X0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& 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)
=> ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2 )
& ssItem(X4) )
| ~ neq(X1,nil)
| neq(X0,nil)
| X0 != X2
| X1 != X3
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2 )
& ssItem(X4) )
| ~ neq(X1,nil)
| neq(X0,nil)
| X0 != X2
| X1 != X3
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f342,plain,
( ~ ssList(sK5)
| nil = sK5
| spl8_13 ),
inference(resolution,[],[f336,f154]) ).
fof(f154,plain,
! [X0] :
( ssItem(sK3(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ( ssList(sK2(X0))
& ssItem(sK3(X0))
& cons(sK3(X0),sK2(X0)) = X0 )
| ~ ssList(X0)
| nil = X0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f102,f128,f127]) ).
fof(f127,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
=> ( ssList(sK2(X0))
& ? [X2] :
( ssItem(X2)
& cons(X2,sK2(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,sK2(X0)) = X0 )
=> ( ssItem(sK3(X0))
& cons(sK3(X0),sK2(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0)
| nil = X0 ),
inference(flattening,[],[f101]) ).
fof(f101,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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f336,plain,
( ~ ssItem(sK3(sK5))
| spl8_13 ),
inference(avatar_component_clause,[],[f334]) ).
fof(f334,plain,
( spl8_13
<=> ssItem(sK3(sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_13])]) ).
fof(f341,plain,
( ~ spl8_13
| ~ spl8_1
| ~ spl8_10 ),
inference(avatar_split_clause,[],[f340,f288,f184,f334]) ).
fof(f184,plain,
( spl8_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f288,plain,
( spl8_10
<=> nil = cons(sK3(sK5),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_10])]) ).
fof(f340,plain,
( ~ ssItem(sK3(sK5))
| ~ spl8_1
| ~ spl8_10 ),
inference(subsumption_resolution,[],[f328,f185]) ).
fof(f185,plain,
( ssList(nil)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f184]) ).
fof(f328,plain,
( ~ ssList(nil)
| ~ ssItem(sK3(sK5))
| ~ spl8_10 ),
inference(trivial_inequality_removal,[],[f326]) ).
fof(f326,plain,
( ~ ssList(nil)
| ~ ssItem(sK3(sK5))
| nil != nil
| ~ spl8_10 ),
inference(superposition,[],[f136,f290]) ).
fof(f290,plain,
( nil = cons(sK3(sK5),nil)
| ~ spl8_10 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f136,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) != X0 ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f316,plain,
( ~ spl8_1
| spl8_4
| spl8_9 ),
inference(avatar_contradiction_clause,[],[f315]) ).
fof(f315,plain,
( $false
| ~ spl8_1
| spl8_4
| spl8_9 ),
inference(subsumption_resolution,[],[f314,f200]) ).
fof(f314,plain,
( nil = sK5
| ~ spl8_1
| spl8_9 ),
inference(subsumption_resolution,[],[f313,f169]) ).
fof(f313,plain,
( ~ ssList(sK5)
| nil = sK5
| ~ spl8_1
| spl8_9 ),
inference(resolution,[],[f312,f154]) ).
fof(f312,plain,
( ~ ssItem(sK3(sK5))
| ~ spl8_1
| spl8_9 ),
inference(subsumption_resolution,[],[f311,f185]) ).
fof(f311,plain,
( ~ ssItem(sK3(sK5))
| ~ ssList(nil)
| spl8_9 ),
inference(resolution,[],[f285,f135]) ).
fof(f135,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f285,plain,
( ~ ssList(cons(sK3(sK5),nil))
| spl8_9 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f283,plain,
( spl8_9
<=> ssList(cons(sK3(sK5),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_9])]) ).
fof(f310,plain,
( ~ spl8_3
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f309]) ).
fof(f309,plain,
( $false
| ~ spl8_3
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f302,f234]) ).
fof(f234,plain,
( ~ neq(nil,nil)
| ~ spl8_3 ),
inference(backward_demodulation,[],[f165,f196]) ).
fof(f196,plain,
( nil = sK4
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f194,plain,
( spl8_3
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f165,plain,
~ neq(sK4,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f302,plain,
( neq(nil,nil)
| ~ spl8_4 ),
inference(backward_demodulation,[],[f166,f199]) ).
fof(f199,plain,
( nil = sK5
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f166,plain,
neq(sK5,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f301,plain,
( spl8_4
| spl8_8 ),
inference(avatar_split_clause,[],[f293,f279,f198]) ).
fof(f279,plain,
( spl8_8
<=> ssList(sK2(sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_8])]) ).
fof(f293,plain,
( nil = sK5
| spl8_8 ),
inference(subsumption_resolution,[],[f292,f169]) ).
fof(f292,plain,
( ~ ssList(sK5)
| nil = sK5
| spl8_8 ),
inference(resolution,[],[f281,f155]) ).
fof(f155,plain,
! [X0] :
( ssList(sK2(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f281,plain,
( ~ ssList(sK2(sK5))
| spl8_8 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f291,plain,
( ~ spl8_8
| ~ spl8_9
| spl8_10
| ~ spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f272,f198,f194,f288,f283,f279]) ).
fof(f272,plain,
( nil = cons(sK3(sK5),nil)
| ~ ssList(cons(sK3(sK5),nil))
| ~ ssList(sK2(sK5))
| ~ spl8_3
| spl8_4 ),
inference(trivial_inequality_removal,[],[f270]) ).
fof(f270,plain,
( ~ ssList(sK2(sK5))
| nil != nil
| ~ ssList(cons(sK3(sK5),nil))
| nil = cons(sK3(sK5),nil)
| ~ spl8_3
| spl8_4 ),
inference(superposition,[],[f140,f268]) ).
fof(f268,plain,
( nil = app(sK2(sK5),cons(sK3(sK5),nil))
| ~ spl8_3
| spl8_4 ),
inference(subsumption_resolution,[],[f267,f200]) ).
fof(f267,plain,
( nil = sK5
| nil = app(sK2(sK5),cons(sK3(sK5),nil))
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f266,f169]) ).
fof(f266,plain,
( ~ ssList(sK5)
| nil = sK5
| nil = app(sK2(sK5),cons(sK3(sK5),nil))
| ~ spl8_3 ),
inference(equality_resolution,[],[f265]) ).
fof(f265,plain,
( ! [X0] :
( sK5 != X0
| ~ ssList(X0)
| nil = app(sK2(X0),cons(sK3(X0),nil))
| nil = X0 )
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f264,f154]) ).
fof(f264,plain,
( ! [X0] :
( nil = app(sK2(X0),cons(sK3(X0),nil))
| nil = X0
| ~ ssItem(sK3(X0))
| sK5 != X0
| ~ ssList(X0) )
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f263,f155]) ).
fof(f263,plain,
( ! [X0] :
( ~ ssList(X0)
| nil = X0
| sK5 != X0
| nil = app(sK2(X0),cons(sK3(X0),nil))
| ~ ssList(sK2(X0))
| ~ ssItem(sK3(X0)) )
| ~ spl8_3 ),
inference(superposition,[],[f261,f153]) ).
fof(f153,plain,
! [X0] :
( cons(sK3(X0),sK2(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f261,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK5
| ~ ssItem(X0)
| nil = app(X1,cons(X0,nil))
| ~ ssList(X1) )
| ~ spl8_3 ),
inference(duplicate_literal_removal,[],[f255]) ).
fof(f255,plain,
( ! [X0,X1] :
( nil = app(X1,cons(X0,nil))
| cons(X0,X1) != sK5
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl8_3 ),
inference(superposition,[],[f233,f171]) ).
fof(f171,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f233,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK5
| nil = app(X5,cons(X4,nil))
| ~ ssItem(X4)
| ~ ssList(X5) )
| ~ spl8_3 ),
inference(backward_demodulation,[],[f175,f196]) ).
fof(f175,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK5
| app(X5,cons(X4,nil)) = sK4
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f161,f167,f163]) ).
fof(f163,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f134]) ).
fof(f167,plain,
sK7 = sK5,
inference(cnf_transformation,[],[f134]) ).
fof(f161,plain,
! [X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| app(cons(X4,nil),X5) != sK7
| app(X5,cons(X4,nil)) = sK6 ),
inference(cnf_transformation,[],[f134]) ).
fof(f140,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| nil = X1 ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) ) ) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) ) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f231,plain,
( spl8_3
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f230,f184,f194]) ).
fof(f230,plain,
( nil = sK4
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f229,f185]) ).
fof(f229,plain,
( nil = sK4
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f224,f170]) ).
fof(f170,plain,
ssList(sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f224,plain,
( ~ ssList(sK4)
| nil = sK4
| ~ ssList(nil) ),
inference(resolution,[],[f148,f165]) ).
fof(f148,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,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(f192,plain,
spl8_1,
inference(avatar_split_clause,[],[f145,f184]) ).
fof(f145,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC211+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_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n011.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:32:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.53 % (28233)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.19/0.54 % (28230)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)
% 0.19/0.54 % (28232)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)
% 0.19/0.55 % (28233)First to succeed.
% 0.19/0.55 % (28249)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.19/0.56 % (28241)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.19/0.56 % (28253)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.56 % (28228)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.57 % (28231)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)
% 0.19/0.57 % (28233)Refutation found. Thanks to Tanya!
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57 % (28233)------------------------------
% 0.19/0.57 % (28233)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (28233)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (28233)Termination reason: Refutation
% 0.19/0.57
% 0.19/0.57 % (28233)Memory used [KB]: 6140
% 0.19/0.57 % (28233)Time elapsed: 0.134 s
% 0.19/0.57 % (28233)Instructions burned: 9 (million)
% 0.19/0.57 % (28233)------------------------------
% 0.19/0.57 % (28233)------------------------------
% 0.19/0.57 % (28226)Success in time 0.216 s
%------------------------------------------------------------------------------