TSTP Solution File: SWC100+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC100+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 : n005.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:44 EDT 2022
% Result : Theorem 1.64s 0.71s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 78 ( 14 unt; 0 def)
% Number of atoms : 512 ( 180 equ)
% Maximal formula atoms : 46 ( 6 avg)
% Number of connectives : 683 ( 249 ~; 228 |; 172 &)
% ( 12 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 148 ( 100 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f682,plain,
$false,
inference(avatar_sat_refutation,[],[f620,f633,f639,f641,f642,f649,f654,f661,f681]) ).
fof(f681,plain,
( ~ spl58_1
| ~ spl58_2
| spl58_6
| ~ spl58_7 ),
inference(avatar_contradiction_clause,[],[f680]) ).
fof(f680,plain,
( $false
| ~ spl58_1
| ~ spl58_2
| spl58_6
| ~ spl58_7 ),
inference(subsumption_resolution,[],[f678,f674]) ).
fof(f674,plain,
( ~ neq(nil,nil)
| spl58_6
| ~ spl58_7 ),
inference(backward_demodulation,[],[f628,f631]) ).
fof(f631,plain,
( nil = sK7
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f630,plain,
( spl58_7
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_7])]) ).
fof(f628,plain,
( ~ neq(sK7,nil)
| spl58_6 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f626,plain,
( spl58_6
<=> neq(sK7,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_6])]) ).
fof(f678,plain,
( neq(nil,nil)
| ~ spl58_1
| ~ spl58_2 ),
inference(backward_demodulation,[],[f610,f606]) ).
fof(f606,plain,
( nil = sK8
| ~ spl58_1 ),
inference(avatar_component_clause,[],[f604]) ).
fof(f604,plain,
( spl58_1
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_1])]) ).
fof(f610,plain,
( neq(sK8,nil)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f608,plain,
( spl58_2
<=> neq(sK8,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).
fof(f661,plain,
spl58_5,
inference(avatar_contradiction_clause,[],[f660]) ).
fof(f660,plain,
( $false
| spl58_5 ),
inference(subsumption_resolution,[],[f659,f624]) ).
fof(f624,plain,
( ~ frontsegP(sK8,sK7)
| spl58_5 ),
inference(avatar_component_clause,[],[f622]) ).
fof(f622,plain,
( spl58_5
<=> frontsegP(sK8,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_5])]) ).
fof(f659,plain,
frontsegP(sK8,sK7),
inference(subsumption_resolution,[],[f658,f363]) ).
fof(f363,plain,
ssList(sK11),
inference(cnf_transformation,[],[f239]) ).
fof(f239,plain,
( ssList(sK8)
& strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK11
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& sK10 = app(sK9,sK11)
& ssList(sK11)
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = sK10
| nil != sK9 )
& sK9 = sK7
& sK10 = sK8
& ssList(sK10)
& ssList(sK9)
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11])],[f99,f238,f237,f236,f235,f234]) ).
fof(f234,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = X1
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(X1,sK7) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& sK7 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f235,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = X1
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(X1,sK7) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& sK7 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK8)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = X3
| nil != X2 )
& sK7 = X2
& sK8 = X3
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f236,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = X3
| nil != X2 )
& sK7 = X2
& sK8 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(sK9,X4) = X3
& ssList(X4) )
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = X3
| nil != sK9 )
& sK9 = sK7
& sK8 = X3
& ssList(X3) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f237,plain,
( ? [X3] :
( ? [X4] :
( strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(sK9,X4) = X3
& ssList(X4) )
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = X3
| nil != sK9 )
& sK9 = sK7
& sK8 = X3
& ssList(X3) )
=> ( ? [X4] :
( strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& sK10 = app(sK9,X4)
& ssList(X4) )
& ( ( nil = sK8
& nil != sK7 )
| ( ( ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) )
& neq(sK8,nil) ) )
& ( nil = sK10
| nil != sK9 )
& sK9 = sK7
& sK10 = sK8
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f238,plain,
( ? [X4] :
( strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& sK10 = app(sK9,X4)
& ssList(X4) )
=> ( strictorderedP(sK9)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK11
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK9
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& sK10 = app(sK9,sK11)
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& app(X2,X4) = X3
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& neq(X1,nil) ) )
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& neq(X1,nil) ) )
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = 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)
=> ( ( nil = X2
& nil != X3 )
| ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil != X1
| nil = X0 ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( lt(X7,X5)
& ssList(X8)
& app(X8,cons(X7,nil)) = X2 ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 ) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil != X1
| nil = X0 ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( lt(X7,X5)
& ssList(X8)
& app(X8,cons(X7,nil)) = X2 ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 ) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f658,plain,
( ~ ssList(sK11)
| frontsegP(sK8,sK7) ),
inference(subsumption_resolution,[],[f657,f367]) ).
fof(f367,plain,
ssList(sK8),
inference(cnf_transformation,[],[f239]) ).
fof(f657,plain,
( ~ ssList(sK8)
| ~ ssList(sK11)
| frontsegP(sK8,sK7) ),
inference(subsumption_resolution,[],[f656,f568]) ).
fof(f568,plain,
ssList(sK7),
inference(definition_unfolding,[],[f354,f357]) ).
fof(f357,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f239]) ).
fof(f354,plain,
ssList(sK9),
inference(cnf_transformation,[],[f239]) ).
fof(f656,plain,
( ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssList(sK11)
| frontsegP(sK8,sK7) ),
inference(superposition,[],[f580,f565]) ).
fof(f565,plain,
sK8 = app(sK7,sK11),
inference(definition_unfolding,[],[f364,f356,f357]) ).
fof(f356,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f239]) ).
fof(f364,plain,
sK10 = app(sK9,sK11),
inference(cnf_transformation,[],[f239]) ).
fof(f580,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X3)
| ~ ssList(app(X1,X3))
| ~ ssList(X1) ),
inference(equality_resolution,[],[f454]) ).
fof(f454,plain,
! [X3,X0,X1] :
( ~ ssList(X1)
| frontsegP(X0,X1)
| app(X1,X3) != X0
| ~ ssList(X3)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f286]) ).
fof(f286,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ( app(X1,sK29(X0,X1)) = X0
& ssList(sK29(X0,X1)) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK29])],[f284,f285]) ).
fof(f285,plain,
! [X0,X1] :
( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
=> ( app(X1,sK29(X0,X1)) = X0
& ssList(sK29(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f284,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f283]) ).
fof(f283,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f654,plain,
( ~ spl58_1
| spl58_7 ),
inference(avatar_split_clause,[],[f653,f630,f604]) ).
fof(f653,plain,
( nil != sK8
| spl58_7 ),
inference(subsumption_resolution,[],[f652,f363]) ).
fof(f652,plain,
( ~ ssList(sK11)
| nil != sK8
| spl58_7 ),
inference(subsumption_resolution,[],[f651,f568]) ).
fof(f651,plain,
( ~ ssList(sK7)
| nil != sK8
| ~ ssList(sK11)
| spl58_7 ),
inference(subsumption_resolution,[],[f650,f632]) ).
fof(f632,plain,
( nil != sK7
| spl58_7 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f650,plain,
( nil = sK7
| ~ ssList(sK11)
| ~ ssList(sK7)
| nil != sK8 ),
inference(superposition,[],[f500,f565]) ).
fof(f500,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X0)
| nil = X0
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f312]) ).
fof(f312,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f311]) ).
fof(f311,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f649,plain,
( ~ spl58_3
| spl58_6
| spl58_7 ),
inference(avatar_contradiction_clause,[],[f648]) ).
fof(f648,plain,
( $false
| ~ spl58_3
| spl58_6
| spl58_7 ),
inference(unit_resulting_resolution,[],[f614,f568,f632,f628,f433]) ).
fof(f433,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f272]) ).
fof(f272,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f212]) ).
fof(f212,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/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f614,plain,
( ssList(nil)
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f613,plain,
( spl58_3
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_3])]) ).
fof(f642,plain,
( spl58_1
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f566,f630,f604]) ).
fof(f566,plain,
( nil != sK7
| nil = sK8 ),
inference(definition_unfolding,[],[f358,f356,f357]) ).
fof(f358,plain,
( nil = sK10
| nil != sK9 ),
inference(cnf_transformation,[],[f239]) ).
fof(f641,plain,
( ~ spl58_6
| ~ spl58_5
| spl58_1 ),
inference(avatar_split_clause,[],[f362,f604,f622,f626]) ).
fof(f362,plain,
( nil = sK8
| ~ frontsegP(sK8,sK7)
| ~ neq(sK7,nil) ),
inference(cnf_transformation,[],[f239]) ).
fof(f639,plain,
( spl58_2
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f359,f630,f608]) ).
fof(f359,plain,
( nil != sK7
| neq(sK8,nil) ),
inference(cnf_transformation,[],[f239]) ).
fof(f633,plain,
( ~ spl58_5
| ~ spl58_6
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f360,f630,f626,f622]) ).
fof(f360,plain,
( nil != sK7
| ~ neq(sK7,nil)
| ~ frontsegP(sK8,sK7) ),
inference(cnf_transformation,[],[f239]) ).
fof(f620,plain,
spl58_3,
inference(avatar_split_clause,[],[f474,f613]) ).
fof(f474,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC100+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_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n005.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:17:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ipcrm: permission denied for id (720797697)
% 0.19/0.36 ipcrm: permission denied for id (720863240)
% 0.19/0.39 ipcrm: permission denied for id (720928794)
% 0.19/0.39 ipcrm: permission denied for id (720961566)
% 0.19/0.41 ipcrm: permission denied for id (721027116)
% 0.19/0.46 ipcrm: permission denied for id (721289301)
% 0.19/0.47 ipcrm: permission denied for id (721322076)
% 0.19/0.50 ipcrm: permission denied for id (721420406)
% 0.19/0.50 ipcrm: permission denied for id (721518711)
% 0.19/0.51 ipcrm: permission denied for id (721485948)
% 0.19/0.51 ipcrm: permission denied for id (721551487)
% 0.73/0.64 % (15891)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/51Mi)
% 1.27/0.66 % (15900)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/101Mi)
% 1.27/0.66 % (15887)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 (2998ds/191324Mi)
% 1.27/0.67 % (15908)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 (2998ds/176Mi)
% 1.27/0.67 % (15890)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/51Mi)
% 1.27/0.67 % (15896)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 1.27/0.67 % (15896)Instruction limit reached!
% 1.27/0.67 % (15896)------------------------------
% 1.27/0.67 % (15896)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.27/0.67 % (15896)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.27/0.67 % (15896)Termination reason: Unknown
% 1.27/0.67 % (15896)Termination phase: Preprocessing 3
% 1.27/0.67
% 1.27/0.67 % (15896)Memory used [KB]: 1151
% 1.27/0.67 % (15896)Time elapsed: 0.003 s
% 1.27/0.67 % (15896)Instructions burned: 4 (million)
% 1.27/0.67 % (15896)------------------------------
% 1.27/0.67 % (15896)------------------------------
% 1.27/0.67 % (15916)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/439Mi)
% 1.27/0.67 % (15904)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 (2998ds/99Mi)
% 1.27/0.68 % (15888)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/50Mi)
% 1.27/0.68 % (15913)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/500Mi)
% 1.27/0.68 % (15906)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 1.27/0.68 % (15909)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/138Mi)
% 1.27/0.68 % (15897)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 (2998ds/51Mi)
% 1.27/0.68 % (15903)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 (2998ds/75Mi)
% 1.27/0.68 % (15899)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 1.27/0.68 % (15893)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 (2998ds/48Mi)
% 1.27/0.68 % (15912)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/482Mi)
% 1.27/0.69 % (15917)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 (2998ds/355Mi)
% 1.27/0.69 % (15915)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 (2998ds/177Mi)
% 1.27/0.69 % (15905)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/59Mi)
% 1.27/0.69 % (15889)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 (2998ds/37Mi)
% 1.27/0.69 % (15895)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/7Mi)
% 1.27/0.69 % (15898)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/50Mi)
% 1.27/0.69 % (15901)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/99Mi)
% 1.27/0.69 % (15895)Instruction limit reached!
% 1.27/0.69 % (15895)------------------------------
% 1.27/0.69 % (15895)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.27/0.69 % (15895)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.27/0.69 % (15895)Termination reason: Unknown
% 1.27/0.69 % (15895)Termination phase: Property scanning
% 1.27/0.69
% 1.27/0.69 % (15895)Memory used [KB]: 1279
% 1.27/0.69 % (15895)Time elapsed: 0.004 s
% 1.27/0.69 % (15895)Instructions burned: 7 (million)
% 1.27/0.69 % (15895)------------------------------
% 1.27/0.69 % (15895)------------------------------
% 1.27/0.69 % (15910)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 (2998ds/498Mi)
% 1.27/0.70 % (15914)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 (2998ds/68Mi)
% 1.27/0.70 % (15911)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 (2998ds/467Mi)
% 1.64/0.70 % (15894)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/51Mi)
% 1.64/0.71 % (15888)First to succeed.
% 1.64/0.71 % (15902)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 (2998ds/68Mi)
% 1.64/0.71 % (15907)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 (2998ds/100Mi)
% 1.64/0.71 % (15888)Refutation found. Thanks to Tanya!
% 1.64/0.71 % SZS status Theorem for theBenchmark
% 1.64/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 1.64/0.71 % (15888)------------------------------
% 1.64/0.71 % (15888)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.71 % (15888)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.71 % (15888)Termination reason: Refutation
% 1.64/0.71
% 1.64/0.71 % (15888)Memory used [KB]: 6012
% 1.64/0.71 % (15888)Time elapsed: 0.130 s
% 1.64/0.71 % (15888)Instructions burned: 20 (million)
% 1.64/0.71 % (15888)------------------------------
% 1.64/0.71 % (15888)------------------------------
% 1.64/0.71 % (15700)Success in time 0.362 s
%------------------------------------------------------------------------------