TSTP Solution File: SWC098+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC098+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 : n018.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.52s 0.60s
% Output : Refutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of formulae : 77 ( 8 unt; 0 def)
% Number of atoms : 524 ( 249 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 681 ( 234 ~; 248 |; 181 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 99 ( 49 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f681,plain,
$false,
inference(subsumption_resolution,[],[f680,f667]) ).
fof(f667,plain,
nil != sK27,
inference(trivial_inequality_removal,[],[f655]) ).
fof(f655,plain,
( nil != sK27
| nil != nil ),
inference(backward_demodulation,[],[f425,f654]) ).
fof(f654,plain,
nil = sK26,
inference(subsumption_resolution,[],[f653,f625]) ).
fof(f625,plain,
( sK26 = sF59
| nil = sK26 ),
inference(forward_demodulation,[],[f621,f439]) ).
fof(f439,plain,
sK26 = sK28,
inference(cnf_transformation,[],[f284]) ).
fof(f284,plain,
( ssList(sK26)
& ssList(sK27)
& sK26 = sK28
& ! [X4] :
( ( leq(X4,sK30(X4))
& memberP(sK27,sK30(X4))
& sK30(X4) != X4
& ssItem(sK30(X4)) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(sK29)
& ( ( ! [X7] :
( sK31 = X7
| ~ ssItem(X7)
| ~ leq(sK31,X7)
| ~ memberP(sK29,X7) )
& cons(sK31,nil) = sK28
& ssItem(sK31)
& memberP(sK29,sK31) )
| ( nil = sK29
& nil = sK28 ) )
& ( nil != sK27
| nil != sK26 )
& sK29 = sK27
& ssList(sK28) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28,sK29,sK30,sK31])],[f202,f283,f282,f281,f280,f279,f278]) ).
fof(f278,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(X1,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != X0
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != X1
| nil != X0 )
& X1 = X3 )
& ssList(X2) ) ) )
=> ( ssList(sK26)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(X1,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != X1
| nil != sK26 )
& X1 = X3 )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f279,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(X1,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != X1
| nil != sK26 )
& X1 = X3 )
& ssList(X2) ) )
=> ( ssList(sK27)
& ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != sK27
| nil != sK26 )
& sK27 = X3 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f280,plain,
( ? [X2] :
( ? [X3] :
( sK26 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != sK27
| nil != sK26 )
& sK27 = X3 )
& ssList(X2) )
=> ( ? [X3] :
( sK26 = sK28
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = sK28
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = sK28 ) )
& ( nil != sK27
| nil != sK26 )
& sK27 = X3 )
& ssList(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
( ? [X3] :
( sK26 = sK28
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = sK28
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = sK28 ) )
& ( nil != sK27
| nil != sK26 )
& sK27 = X3 )
=> ( sK26 = sK28
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4) )
& ssList(sK29)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(sK29,X7) )
& cons(X6,nil) = sK28
& ssItem(X6)
& memberP(sK29,X6) )
| ( nil = sK29
& nil = sK28 ) )
& ( nil != sK27
| nil != sK26 )
& sK29 = sK27 ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(sK27,X5)
& X4 != X5
& ssItem(X5) )
=> ( leq(X4,sK30(X4))
& memberP(sK27,sK30(X4))
& sK30(X4) != X4
& ssItem(sK30(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(sK29,X7) )
& cons(X6,nil) = sK28
& ssItem(X6)
& memberP(sK29,X6) )
=> ( ! [X7] :
( sK31 = X7
| ~ ssItem(X7)
| ~ leq(sK31,X7)
| ~ memberP(sK29,X7) )
& cons(sK31,nil) = sK28
& ssItem(sK31)
& memberP(sK29,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f202,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(X1,X5)
& X4 != X5
& ssItem(X5) )
| cons(X4,nil) != X0
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& ssList(X3)
& ( ? [X6] :
( ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6)
& memberP(X3,X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != X1
| nil != X0 )
& X1 = X3 )
& ssList(X2) ) ) ),
inference(flattening,[],[f201]) ).
fof(f201,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ssItem(X4)
| ? [X5] :
( leq(X4,X5)
& X4 != X5
& memberP(X1,X5)
& ssItem(X5) )
| cons(X4,nil) != X0
| ~ memberP(X1,X4) )
& X1 = X3
& ( ? [X6] :
( memberP(X3,X6)
& ! [X7] :
( X6 = X7
| ~ ssItem(X7)
| ~ leq(X6,X7)
| ~ memberP(X3,X7) )
& cons(X6,nil) = X2
& ssItem(X6) )
| ( nil = X3
& nil = X2 ) )
& ( nil != X1
| nil != X0 )
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ! [X5] :
( ssItem(X5)
=> ( ~ leq(X4,X5)
| X4 = X5
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& memberP(X1,X4) )
| X1 != X3
| ( ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X3,X6)
| ? [X7] :
( leq(X6,X7)
& ssItem(X7)
& memberP(X3,X7)
& X6 != X7 )
| cons(X6,nil) != X2 ) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ! [X5] :
( ssItem(X5)
=> ( ~ leq(X4,X5)
| X4 = X5
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& memberP(X1,X4) )
| X1 != X3
| ( ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X3,X6)
| ? [X7] :
( leq(X6,X7)
& ssItem(X7)
& memberP(X3,X7)
& X6 != X7 )
| cons(X6,nil) != X2 ) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f621,plain,
( sK28 = sF59
| nil = sK26 ),
inference(backward_demodulation,[],[f597,f439]) ).
fof(f597,plain,
( sK28 = sF59
| nil = sK28 ),
inference(definition_folding,[],[f430,f595]) ).
fof(f595,plain,
cons(sK31,nil) = sF59,
introduced(function_definition,[]) ).
fof(f430,plain,
( cons(sK31,nil) = sK28
| nil = sK28 ),
inference(cnf_transformation,[],[f284]) ).
fof(f653,plain,
( nil = sK26
| sK26 != sF59 ),
inference(superposition,[],[f652,f595]) ).
fof(f652,plain,
( sK26 != cons(sK31,nil)
| nil = sK26 ),
inference(subsumption_resolution,[],[f651,f623]) ).
fof(f623,plain,
( memberP(sK27,sK31)
| nil = sK26 ),
inference(backward_demodulation,[],[f613,f439]) ).
fof(f613,plain,
( nil = sK28
| memberP(sK27,sK31) ),
inference(forward_demodulation,[],[f426,f424]) ).
fof(f424,plain,
sK29 = sK27,
inference(cnf_transformation,[],[f284]) ).
fof(f426,plain,
( memberP(sK29,sK31)
| nil = sK28 ),
inference(cnf_transformation,[],[f284]) ).
fof(f651,plain,
( sK26 != cons(sK31,nil)
| ~ memberP(sK27,sK31)
| nil = sK26 ),
inference(subsumption_resolution,[],[f650,f620]) ).
fof(f620,plain,
( ssItem(sK31)
| nil = sK26 ),
inference(backward_demodulation,[],[f428,f439]) ).
fof(f428,plain,
( ssItem(sK31)
| nil = sK28 ),
inference(cnf_transformation,[],[f284]) ).
fof(f650,plain,
( ~ memberP(sK27,sK31)
| nil = sK26
| ~ ssItem(sK31)
| sK26 != cons(sK31,nil) ),
inference(subsumption_resolution,[],[f649,f436]) ).
fof(f436,plain,
! [X4] :
( cons(X4,nil) != sK26
| ~ memberP(sK27,X4)
| ~ ssItem(X4)
| sK30(X4) != X4 ),
inference(cnf_transformation,[],[f284]) ).
fof(f649,plain,
( ~ memberP(sK27,sK31)
| nil = sK26
| ~ ssItem(sK31)
| sK26 != cons(sK31,nil)
| sK30(sK31) = sK31 ),
inference(resolution,[],[f644,f437]) ).
fof(f437,plain,
! [X4] :
( memberP(sK27,sK30(X4))
| ~ memberP(sK27,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK26 ),
inference(cnf_transformation,[],[f284]) ).
fof(f644,plain,
( ~ memberP(sK27,sK30(sK31))
| sK30(sK31) = sK31
| nil = sK26 ),
inference(subsumption_resolution,[],[f643,f625]) ).
fof(f643,plain,
( sK30(sK31) = sK31
| sK26 != sF59
| nil = sK26
| ~ memberP(sK27,sK30(sK31)) ),
inference(subsumption_resolution,[],[f642,f623]) ).
fof(f642,plain,
( sK26 != sF59
| sK30(sK31) = sK31
| nil = sK26
| ~ memberP(sK27,sK30(sK31))
| ~ memberP(sK27,sK31) ),
inference(subsumption_resolution,[],[f641,f620]) ).
fof(f641,plain,
( ~ ssItem(sK31)
| nil = sK26
| ~ memberP(sK27,sK31)
| sK30(sK31) = sK31
| ~ memberP(sK27,sK30(sK31))
| sK26 != sF59 ),
inference(subsumption_resolution,[],[f639,f632]) ).
fof(f632,plain,
( ~ memberP(sK27,sK31)
| sK26 != sF59
| ssItem(sK30(sK31))
| ~ ssItem(sK31) ),
inference(superposition,[],[f435,f595]) ).
fof(f435,plain,
! [X4] :
( cons(X4,nil) != sK26
| ssItem(sK30(X4))
| ~ memberP(sK27,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f284]) ).
fof(f639,plain,
( ~ ssItem(sK31)
| nil = sK26
| sK30(sK31) = sK31
| ~ memberP(sK27,sK31)
| sK26 != sF59
| ~ ssItem(sK30(sK31))
| ~ memberP(sK27,sK30(sK31)) ),
inference(resolution,[],[f630,f624]) ).
fof(f624,plain,
! [X7] :
( ~ leq(sK31,X7)
| sK31 = X7
| nil = sK26
| ~ memberP(sK27,X7)
| ~ ssItem(X7) ),
inference(backward_demodulation,[],[f617,f439]) ).
fof(f617,plain,
! [X7] :
( nil = sK28
| ~ memberP(sK27,X7)
| ~ leq(sK31,X7)
| sK31 = X7
| ~ ssItem(X7) ),
inference(forward_demodulation,[],[f432,f424]) ).
fof(f432,plain,
! [X7] :
( ~ leq(sK31,X7)
| sK31 = X7
| ~ ssItem(X7)
| ~ memberP(sK29,X7)
| nil = sK28 ),
inference(cnf_transformation,[],[f284]) ).
fof(f630,plain,
( leq(sK31,sK30(sK31))
| ~ memberP(sK27,sK31)
| ~ ssItem(sK31)
| sK26 != sF59 ),
inference(superposition,[],[f438,f595]) ).
fof(f438,plain,
! [X4] :
( cons(X4,nil) != sK26
| ~ ssItem(X4)
| ~ memberP(sK27,X4)
| leq(X4,sK30(X4)) ),
inference(cnf_transformation,[],[f284]) ).
fof(f425,plain,
( nil != sK27
| nil != sK26 ),
inference(cnf_transformation,[],[f284]) ).
fof(f680,plain,
nil = sK27,
inference(trivial_inequality_removal,[],[f679]) ).
fof(f679,plain,
( nil = sK27
| nil != nil ),
inference(superposition,[],[f678,f662]) ).
fof(f662,plain,
( nil = sF59
| nil = sK27 ),
inference(backward_demodulation,[],[f622,f654]) ).
fof(f622,plain,
( sK26 = sF59
| nil = sK27 ),
inference(backward_demodulation,[],[f609,f439]) ).
fof(f609,plain,
( nil = sK27
| sK28 = sF59 ),
inference(backward_demodulation,[],[f596,f424]) ).
fof(f596,plain,
( sK28 = sF59
| nil = sK29 ),
inference(definition_folding,[],[f431,f595]) ).
fof(f431,plain,
( cons(sK31,nil) = sK28
| nil = sK29 ),
inference(cnf_transformation,[],[f284]) ).
fof(f678,plain,
nil != sF59,
inference(subsumption_resolution,[],[f677,f667]) ).
fof(f677,plain,
( nil = sK27
| nil != sF59 ),
inference(resolution,[],[f676,f618]) ).
fof(f618,plain,
( ssItem(sK31)
| nil = sK27 ),
inference(forward_demodulation,[],[f429,f424]) ).
fof(f429,plain,
( ssItem(sK31)
| nil = sK29 ),
inference(cnf_transformation,[],[f284]) ).
fof(f676,plain,
( ~ ssItem(sK31)
| nil != sF59 ),
inference(subsumption_resolution,[],[f675,f667]) ).
fof(f675,plain,
( ~ ssItem(sK31)
| nil != sF59
| nil = sK27 ),
inference(resolution,[],[f674,f611]) ).
fof(f611,plain,
( memberP(sK27,sK31)
| nil = sK27 ),
inference(forward_demodulation,[],[f610,f424]) ).
fof(f610,plain,
( nil = sK27
| memberP(sK29,sK31) ),
inference(backward_demodulation,[],[f427,f424]) ).
fof(f427,plain,
( memberP(sK29,sK31)
| nil = sK29 ),
inference(cnf_transformation,[],[f284]) ).
fof(f674,plain,
( ~ memberP(sK27,sK31)
| ~ ssItem(sK31)
| nil != sF59 ),
inference(forward_demodulation,[],[f673,f595]) ).
fof(f673,plain,
( nil != cons(sK31,nil)
| ~ ssItem(sK31)
| ~ memberP(sK27,sK31) ),
inference(subsumption_resolution,[],[f672,f657]) ).
fof(f657,plain,
! [X4] :
( sK30(X4) != X4
| ~ memberP(sK27,X4)
| ~ ssItem(X4)
| nil != cons(X4,nil) ),
inference(backward_demodulation,[],[f436,f654]) ).
fof(f672,plain,
( nil != cons(sK31,nil)
| sK30(sK31) = sK31
| ~ ssItem(sK31)
| ~ memberP(sK27,sK31) ),
inference(subsumption_resolution,[],[f671,f667]) ).
fof(f671,plain,
( sK30(sK31) = sK31
| ~ memberP(sK27,sK31)
| nil != cons(sK31,nil)
| nil = sK27
| ~ ssItem(sK31) ),
inference(resolution,[],[f658,f648]) ).
fof(f648,plain,
( ~ memberP(sK27,sK30(sK31))
| sK30(sK31) = sK31
| nil = sK27 ),
inference(subsumption_resolution,[],[f647,f611]) ).
fof(f647,plain,
( sK30(sK31) = sK31
| ~ memberP(sK27,sK31)
| nil = sK27
| ~ memberP(sK27,sK30(sK31)) ),
inference(subsumption_resolution,[],[f646,f622]) ).
fof(f646,plain,
( sK26 != sF59
| ~ memberP(sK27,sK30(sK31))
| sK30(sK31) = sK31
| nil = sK27
| ~ memberP(sK27,sK31) ),
inference(subsumption_resolution,[],[f645,f618]) ).
fof(f645,plain,
( sK30(sK31) = sK31
| ~ memberP(sK27,sK31)
| sK26 != sF59
| nil = sK27
| ~ memberP(sK27,sK30(sK31))
| ~ ssItem(sK31) ),
inference(subsumption_resolution,[],[f640,f632]) ).
fof(f640,plain,
( sK30(sK31) = sK31
| ~ ssItem(sK31)
| ~ memberP(sK27,sK31)
| nil = sK27
| sK26 != sF59
| ~ ssItem(sK30(sK31))
| ~ memberP(sK27,sK30(sK31)) ),
inference(resolution,[],[f630,f615]) ).
fof(f615,plain,
! [X7] :
( ~ leq(sK31,X7)
| ~ ssItem(X7)
| ~ memberP(sK27,X7)
| nil = sK27
| sK31 = X7 ),
inference(forward_demodulation,[],[f614,f424]) ).
fof(f614,plain,
! [X7] :
( ~ memberP(sK29,X7)
| ~ ssItem(X7)
| sK31 = X7
| nil = sK27
| ~ leq(sK31,X7) ),
inference(forward_demodulation,[],[f433,f424]) ).
fof(f433,plain,
! [X7] :
( ~ leq(sK31,X7)
| sK31 = X7
| ~ ssItem(X7)
| nil = sK29
| ~ memberP(sK29,X7) ),
inference(cnf_transformation,[],[f284]) ).
fof(f658,plain,
! [X4] :
( memberP(sK27,sK30(X4))
| ~ memberP(sK27,X4)
| nil != cons(X4,nil)
| ~ ssItem(X4) ),
inference(backward_demodulation,[],[f437,f654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC098+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:19:25 EDT 2022
% 0.12/0.35 % CPUTime :
% 1.38/0.55 % (32680)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.38/0.55 % (32679)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.38/0.55 % (32680)Instruction limit reached!
% 1.38/0.55 % (32680)------------------------------
% 1.38/0.55 % (32680)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.38/0.55 % (32680)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.38/0.55 % (32680)Termination reason: Unknown
% 1.38/0.55 % (32680)Termination phase: shuffling
% 1.38/0.55
% 1.38/0.55 % (32680)Memory used [KB]: 1023
% 1.38/0.55 % (32680)Time elapsed: 0.003 s
% 1.38/0.55 % (32680)Instructions burned: 3 (million)
% 1.38/0.55 % (32680)------------------------------
% 1.38/0.55 % (32680)------------------------------
% 1.52/0.56 % (32679)Instruction limit reached!
% 1.52/0.56 % (32679)------------------------------
% 1.52/0.56 % (32679)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.56 % (32688)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.52/0.56 % (32696)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.52/0.56 % (32695)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.52/0.56 % (32687)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.52/0.57 % (32678)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.52/0.58 % (32694)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.52/0.58 % (32679)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.58 % (32679)Termination reason: Unknown
% 1.52/0.58 % (32679)Termination phase: Property scanning
% 1.52/0.58
% 1.52/0.58 % (32679)Memory used [KB]: 1279
% 1.52/0.58 % (32679)Time elapsed: 0.006 s
% 1.52/0.58 % (32679)Instructions burned: 8 (million)
% 1.52/0.58 % (32679)------------------------------
% 1.52/0.58 % (32679)------------------------------
% 1.52/0.59 % (32686)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.52/0.59 % (32687)First to succeed.
% 1.52/0.60 % (32687)Refutation found. Thanks to Tanya!
% 1.52/0.60 % SZS status Theorem for theBenchmark
% 1.52/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.52/0.60 % (32687)------------------------------
% 1.52/0.60 % (32687)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.60 % (32687)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.60 % (32687)Termination reason: Refutation
% 1.52/0.60
% 1.52/0.60 % (32687)Memory used [KB]: 1535
% 1.52/0.60 % (32687)Time elapsed: 0.176 s
% 1.52/0.60 % (32687)Instructions burned: 22 (million)
% 1.52/0.60 % (32687)------------------------------
% 1.52/0.60 % (32687)------------------------------
% 1.52/0.60 % (32671)Success in time 0.244 s
%------------------------------------------------------------------------------