TSTP Solution File: SWC013+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC013+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 : n004.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:12 EDT 2022
% Result : Theorem 0.18s 0.58s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of formulae : 72 ( 18 unt; 0 def)
% Number of atoms : 485 ( 173 equ)
% Maximal formula atoms : 42 ( 6 avg)
% Number of connectives : 694 ( 281 ~; 259 |; 130 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 128 ( 88 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f933,plain,
$false,
inference(subsumption_resolution,[],[f931,f446]) ).
fof(f446,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f931,plain,
~ ssList(nil),
inference(resolution,[],[f918,f610]) ).
fof(f610,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f587]) ).
fof(f587,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f502]) ).
fof(f502,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f322]) ).
fof(f322,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
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(f918,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f609,f915]) ).
fof(f915,plain,
nil = sK36,
inference(subsumption_resolution,[],[f914,f446]) ).
fof(f914,plain,
( nil = sK36
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f908,f468]) ).
fof(f468,plain,
ssList(sK36),
inference(cnf_transformation,[],[f306]) ).
fof(f306,plain,
( sK36 = sK38
& ssList(sK38)
& ( ( ! [X4] :
( sK37 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(sK38) != X5
| cons(X5,nil) != X4
| ~ neq(nil,sK38) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(sK38,nil)
& neq(sK36,nil) ) )
& sK35 = sK37
& ssList(sK37)
& ssList(sK36)
& ssList(sK35) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38])],[f301,f305,f304,f303,f302]) ).
fof(f302,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ ssList(X6)
| X0 != X6 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& sK35 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f303,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& sK35 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK36 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(X3,nil)
& neq(sK36,nil) ) )
& sK35 = X2 )
& ssList(X2) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f304,plain,
( ? [X2] :
( ? [X3] :
( sK36 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(X3,nil)
& neq(sK36,nil) ) )
& sK35 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( sK36 = X3
& ssList(X3)
& ( ( ! [X4] :
( sK37 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(X3,nil)
& neq(sK36,nil) ) )
& sK35 = sK37 )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f305,plain,
( ? [X3] :
( sK36 = X3
& ssList(X3)
& ( ( ! [X4] :
( sK37 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(X3,nil)
& neq(sK36,nil) ) )
& sK35 = sK37 )
=> ( sK36 = sK38
& ssList(sK38)
& ( ( ! [X4] :
( sK37 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(sK38) != X5
| cons(X5,nil) != X4
| ~ neq(nil,sK38) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36) )
| ~ ssList(X6)
| sK35 != X6 )
& neq(sK36,nil) )
| ( ~ neq(sK38,nil)
& neq(sK36,nil) ) )
& sK35 = sK37 ) ),
introduced(choice_axiom,[]) ).
fof(f301,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( X2 = X4
| ~ ssList(X4)
| ! [X5] :
( ~ ssItem(X5)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ neq(nil,X3) ) )
& ! [X6] :
( ! [X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ ssList(X6)
| X0 != X6 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f187]) ).
fof(f187,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X6] :
( X2 = X6
| ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ neq(nil,X3) ) )
& ! [X4] :
( ! [X5] :
( cons(X5,nil) != X4
| ~ ssItem(X5)
| hd(X1) != X5
| ~ neq(nil,X1) )
| ~ ssList(X4)
| X0 != X4 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f186]) ).
fof(f186,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( ! [X6] :
( X2 = X6
| ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ neq(nil,X3) ) )
& ! [X4] :
( ! [X5] :
( cons(X5,nil) != X4
| ~ ssItem(X5)
| hd(X1) != X5
| ~ neq(nil,X1) )
| ~ ssList(X4)
| X0 != X4 )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ? [X6] :
( X2 != X6
& ssList(X6)
& ? [X7] :
( ssItem(X7)
& neq(nil,X3)
& cons(X7,nil) = X6
& hd(X3) = X7 ) )
| ? [X4] :
( ? [X5] :
( hd(X1) = X5
& neq(nil,X1)
& cons(X5,nil) = X4
& ssItem(X5) )
& X0 = X4
& ssList(X4) ) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ? [X6] :
( ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& neq(nil,X1)
& hd(X1) = X7 )
& X0 = X6
& ssList(X6) )
| ~ neq(X1,nil)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5 )
& X2 != X4
& ssList(X4) ) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ? [X6] :
( ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& neq(nil,X1)
& hd(X1) = X7 )
& X0 = X6
& ssList(X6) )
| ~ neq(X1,nil)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5 )
& X2 != X4
& ssList(X4) ) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f908,plain,
( ~ ssList(sK36)
| ~ ssList(nil)
| nil = sK36 ),
inference(duplicate_literal_removal,[],[f907]) ).
fof(f907,plain,
( nil = sK36
| nil = sK36
| ~ ssList(nil)
| ~ ssList(sK36) ),
inference(resolution,[],[f503,f721]) ).
fof(f721,plain,
( ~ neq(nil,sK36)
| nil = sK36 ),
inference(subsumption_resolution,[],[f717,f700]) ).
fof(f700,plain,
( ssItem(sF57)
| nil = sK36 ),
inference(subsumption_resolution,[],[f699,f468]) ).
fof(f699,plain,
( ssItem(sF57)
| ~ ssList(sK36)
| nil = sK36 ),
inference(superposition,[],[f443,f616]) ).
fof(f616,plain,
sF57 = hd(sK36),
inference(backward_demodulation,[],[f596,f478]) ).
fof(f478,plain,
sK36 = sK38,
inference(cnf_transformation,[],[f306]) ).
fof(f596,plain,
hd(sK38) = sF57,
introduced(function_definition,[]) ).
fof(f443,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(hd(X0))
| nil = X0 ),
inference(flattening,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
fof(f717,plain,
( ~ neq(nil,sK36)
| ~ ssItem(sF57)
| nil = sK36 ),
inference(resolution,[],[f707,f628]) ).
fof(f628,plain,
( ~ ssList(sF58)
| ~ ssItem(sF57)
| ~ neq(nil,sK36) ),
inference(subsumption_resolution,[],[f627,f623]) ).
fof(f623,plain,
( ~ ssList(sF58)
| sK35 = sF58
| ~ neq(nil,sK36)
| ~ ssItem(sF57) ),
inference(forward_demodulation,[],[f622,f478]) ).
fof(f622,plain,
( ~ ssList(sF58)
| sK35 = sF58
| ~ neq(nil,sK38)
| ~ ssItem(sF57) ),
inference(subsumption_resolution,[],[f617,f609]) ).
fof(f617,plain,
( ~ neq(nil,sK38)
| sK35 = sF58
| ~ neq(sK36,nil)
| ~ ssList(sF58)
| ~ ssItem(sF57) ),
inference(backward_demodulation,[],[f613,f478]) ).
fof(f613,plain,
( ~ neq(nil,sK38)
| sK35 = sF58
| ~ ssItem(sF57)
| ~ ssList(sF58)
| ~ neq(sK38,nil) ),
inference(backward_demodulation,[],[f598,f470]) ).
fof(f470,plain,
sK35 = sK37,
inference(cnf_transformation,[],[f306]) ).
fof(f598,plain,
( ~ ssItem(sF57)
| ~ ssList(sF58)
| sF58 = sK37
| ~ neq(sK38,nil)
| ~ neq(nil,sK38) ),
inference(definition_folding,[],[f578,f596,f597,f596,f597,f596]) ).
fof(f597,plain,
cons(sF57,nil) = sF58,
introduced(function_definition,[]) ).
fof(f578,plain,
( cons(hd(sK38),nil) = sK37
| ~ ssList(cons(hd(sK38),nil))
| ~ ssItem(hd(sK38))
| ~ neq(nil,sK38)
| ~ neq(sK38,nil) ),
inference(equality_resolution,[],[f577]) ).
fof(f577,plain,
! [X4] :
( sK37 = X4
| ~ ssList(X4)
| ~ ssItem(hd(sK38))
| cons(hd(sK38),nil) != X4
| ~ neq(nil,sK38)
| ~ neq(sK38,nil) ),
inference(equality_resolution,[],[f476]) ).
fof(f476,plain,
! [X4,X5] :
( sK37 = X4
| ~ ssList(X4)
| ~ ssItem(X5)
| hd(sK38) != X5
| cons(X5,nil) != X4
| ~ neq(nil,sK38)
| ~ neq(sK38,nil) ),
inference(cnf_transformation,[],[f306]) ).
fof(f627,plain,
( ~ ssItem(sF57)
| ~ ssList(sF58)
| sK35 != sF58
| ~ neq(nil,sK36) ),
inference(forward_demodulation,[],[f626,f621]) ).
fof(f621,plain,
sF58 = sF60,
inference(forward_demodulation,[],[f620,f597]) ).
fof(f620,plain,
cons(sF57,nil) = sF60,
inference(backward_demodulation,[],[f601,f619]) ).
fof(f619,plain,
sF59 = sF57,
inference(backward_demodulation,[],[f600,f616]) ).
fof(f600,plain,
sF59 = hd(sK36),
introduced(function_definition,[]) ).
fof(f601,plain,
cons(sF59,nil) = sF60,
introduced(function_definition,[]) ).
fof(f626,plain,
( ~ ssList(sF58)
| sK35 != sF60
| ~ ssItem(sF57)
| ~ neq(nil,sK36) ),
inference(forward_demodulation,[],[f625,f619]) ).
fof(f625,plain,
( ~ ssItem(sF59)
| sK35 != sF60
| ~ ssList(sF58)
| ~ neq(nil,sK36) ),
inference(forward_demodulation,[],[f624,f621]) ).
fof(f624,plain,
( ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK36)
| sK35 != sF60 ),
inference(subsumption_resolution,[],[f618,f609]) ).
fof(f618,plain,
( ~ neq(nil,sK36)
| ~ neq(sK36,nil)
| ~ ssList(sF60)
| sK35 != sF60
| ~ ssItem(sF59) ),
inference(backward_demodulation,[],[f602,f478]) ).
fof(f602,plain,
( sK35 != sF60
| ~ neq(nil,sK36)
| ~ neq(sK38,nil)
| ~ ssList(sF60)
| ~ ssItem(sF59) ),
inference(definition_folding,[],[f582,f601,f600,f601,f600,f600]) ).
fof(f582,plain,
( ~ ssItem(hd(sK36))
| ~ neq(nil,sK36)
| ~ ssList(cons(hd(sK36),nil))
| sK35 != cons(hd(sK36),nil)
| ~ neq(sK38,nil) ),
inference(equality_resolution,[],[f581]) ).
fof(f581,plain,
! [X7] :
( ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36)
| ~ ssList(cons(X7,nil))
| cons(X7,nil) != sK35
| ~ neq(sK38,nil) ),
inference(equality_resolution,[],[f474]) ).
fof(f474,plain,
! [X6,X7] :
( cons(X7,nil) != X6
| ~ ssItem(X7)
| hd(sK36) != X7
| ~ neq(nil,sK36)
| ~ ssList(X6)
| sK35 != X6
| ~ neq(sK38,nil) ),
inference(cnf_transformation,[],[f306]) ).
fof(f707,plain,
( ssList(sF58)
| nil = sK36 ),
inference(resolution,[],[f706,f700]) ).
fof(f706,plain,
( ~ ssItem(sF57)
| ssList(sF58) ),
inference(subsumption_resolution,[],[f705,f446]) ).
fof(f705,plain,
( ~ ssList(nil)
| ssList(sF58)
| ~ ssItem(sF57) ),
inference(superposition,[],[f540,f597]) ).
fof(f540,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) ) ),
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(f503,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f322]) ).
fof(f609,plain,
neq(sK36,nil),
inference(duplicate_literal_removal,[],[f471]) ).
fof(f471,plain,
( neq(sK36,nil)
| neq(sK36,nil) ),
inference(cnf_transformation,[],[f306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC013+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_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n004.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 17:52:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.48 % (27564)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 (2999ds/191324Mi)
% 0.18/0.50 % (27587)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)
% 0.18/0.50 % (27579)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)
% 0.18/0.50 % (27570)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)
% 0.18/0.51 % (27580)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)
% 0.18/0.51 % (27568)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (27571)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.52 % (27572)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.52 % (27572)Instruction limit reached!
% 0.18/0.52 % (27572)------------------------------
% 0.18/0.52 % (27572)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (27572)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (27572)Termination reason: Unknown
% 0.18/0.52 % (27572)Termination phase: Preprocessing 1
% 0.18/0.52
% 0.18/0.52 % (27572)Memory used [KB]: 895
% 0.18/0.52 % (27572)Time elapsed: 0.003 s
% 0.18/0.52 % (27572)Instructions burned: 2 (million)
% 0.18/0.52 % (27572)------------------------------
% 0.18/0.52 % (27572)------------------------------
% 0.18/0.53 % (27567)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.53 % (27571)Instruction limit reached!
% 0.18/0.53 % (27571)------------------------------
% 0.18/0.53 % (27571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (27571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (27571)Termination reason: Unknown
% 0.18/0.53 % (27571)Termination phase: Function definition elimination
% 0.18/0.53
% 0.18/0.53 % (27571)Memory used [KB]: 1279
% 0.18/0.53 % (27571)Time elapsed: 0.013 s
% 0.18/0.53 % (27571)Instructions burned: 8 (million)
% 0.18/0.53 % (27571)------------------------------
% 0.18/0.53 % (27571)------------------------------
% 0.18/0.53 % (27566)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 (2999ds/37Mi)
% 0.18/0.53 % (27565)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.54 % (27586)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)
% 0.18/0.54 % (27569)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 (2999ds/48Mi)
% 0.18/0.54 % (27583)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 (2999ds/100Mi)
% 0.18/0.55 % (27581)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.18/0.55 % (27573)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 (2999ds/51Mi)
% 0.18/0.55 % (27591)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 (2999ds/177Mi)
% 0.18/0.55 % (27584)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 (2999ds/176Mi)
% 0.18/0.55 % (27593)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 (2999ds/355Mi)
% 0.18/0.55 % (27582)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.55 TRYING [1]
% 0.18/0.56 TRYING [2]
% 0.18/0.56 % (27589)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.56 % (27575)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.56 TRYING [1]
% 0.18/0.57 % (27585)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.57 % (27576)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.57 % (27578)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)
% 0.18/0.57 % (27579)First to succeed.
% 0.18/0.57 % (27592)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.57 % (27590)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)
% 0.18/0.58 % (27577)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.58 % (27588)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.58 % (27579)Refutation found. Thanks to Tanya!
% 0.18/0.58 % SZS status Theorem for theBenchmark
% 0.18/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.58 % (27579)------------------------------
% 0.18/0.58 % (27579)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.58 % (27579)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.58 % (27579)Termination reason: Refutation
% 0.18/0.58
% 0.18/0.58 % (27579)Memory used [KB]: 1791
% 0.18/0.58 % (27579)Time elapsed: 0.118 s
% 0.18/0.58 % (27579)Instructions burned: 36 (million)
% 0.18/0.58 % (27579)------------------------------
% 0.18/0.58 % (27579)------------------------------
% 0.18/0.58 % (27563)Success in time 0.237 s
%------------------------------------------------------------------------------