TSTP Solution File: SWC241+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC241+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 : n025.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:42:38 EDT 2022
% Result : Theorem 1.79s 0.59s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 12 unt; 0 def)
% Number of atoms : 524 ( 133 equ)
% Maximal formula atoms : 52 ( 9 avg)
% Number of connectives : 718 ( 252 ~; 232 |; 207 &)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-3 aty)
% Number of variables : 196 ( 118 !; 78 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f816,plain,
$false,
inference(subsumption_resolution,[],[f815,f620]) ).
fof(f620,plain,
ssList(sK41),
inference(subsumption_resolution,[],[f611,f459]) ).
fof(f459,plain,
nil != sK35,
inference(cnf_transformation,[],[f302]) ).
fof(f302,plain,
( sK37 = sK35
& sK38 = sK36
& ( ( sK37 = app(app(sK40,cons(sK39,nil)),sK41)
& ! [X7] :
( ~ memberP(sK41,X7)
| ~ memberP(sK40,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(sK41)
& ssList(sK40)
& ssItem(sK39) )
| nil = sK37 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( lt(X8,sK42(X8,X9,X10))
& ~ leq(X8,sK42(X8,X9,X10))
& memberP(X9,sK42(X8,X9,X10))
& ssItem(sK42(X8,X9,X10))
& memberP(X10,sK42(X8,X9,X10)) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(sK38)
& ssList(sK37)
& ssList(sK36)
& ssList(sK35) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38,sK39,sK40,sK41,sK42])],[f122,f301,f300,f299,f298,f297,f296,f295,f294]) ).
fof(f294,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != X0
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK35 = X2
& X1 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f295,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK35 = X2
& X1 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK35 = X2
& sK36 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f296,plain,
( ? [X2] :
( ? [X3] :
( sK35 = X2
& sK36 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( sK37 = sK35
& sK36 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK37
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK37 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f297,plain,
( ? [X3] :
( sK37 = sK35
& sK36 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK37
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK37 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
=> ( sK37 = sK35
& sK38 = sK36
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK37
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK37 )
& nil != sK35
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f298,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK37
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK37 = app(app(X5,cons(sK39,nil)),X6)
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(sK39) ) ),
introduced(choice_axiom,[]) ).
fof(f299,plain,
( ? [X5] :
( ? [X6] :
( sK37 = app(app(X5,cons(sK39,nil)),X6)
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK37 = app(app(sK40,cons(sK39,nil)),X6)
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(sK40,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(X6) )
& ssList(sK40) ) ),
introduced(choice_axiom,[]) ).
fof(f300,plain,
( ? [X6] :
( sK37 = app(app(sK40,cons(sK39,nil)),X6)
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(sK40,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(X6) )
=> ( sK37 = app(app(sK40,cons(sK39,nil)),sK41)
& ! [X7] :
( ~ memberP(sK41,X7)
| ~ memberP(sK40,X7)
| ~ ssItem(X7)
| leq(X7,sK39)
| ~ leq(sK39,X7) )
& ssList(sK41) ) ),
introduced(choice_axiom,[]) ).
fof(f301,plain,
! [X8,X9,X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
=> ( lt(X8,sK42(X8,X9,X10))
& ~ leq(X8,sK42(X8,X9,X10))
& memberP(X9,sK42(X8,X9,X10))
& ssItem(sK42(X8,X9,X10))
& memberP(X10,sK42(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ! [X7] :
( ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| leq(X7,X4)
| ~ leq(X4,X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& nil != X0
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( lt(X8,X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& 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] :
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10)
& ! [X11] :
( ~ ssItem(X11)
| ~ memberP(X9,X11)
| leq(X8,X11)
| ~ memberP(X10,X11)
| ~ lt(X8,X11) ) ) ) )
| X1 != X3
| nil = X0
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( leq(X4,X7)
& memberP(X5,X7)
& ~ leq(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) ) ) )
& nil != X2 )
| ~ ssList(X3)
| X0 != X2 ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ~ leq(X11,X8)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11)
& leq(X8,X11) )
| ~ ssList(X10) ) ) ) )
| nil = X0
| X1 != X3
| X0 != X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X4,X7)
| leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ~ leq(X11,X8)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11)
& leq(X8,X11) )
| ~ ssList(X10) ) ) ) )
| nil = X0
| X1 != X3
| X0 != X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X4,X7)
| leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f611,plain,
( ssList(sK41)
| nil = sK35 ),
inference(backward_demodulation,[],[f462,f466]) ).
fof(f466,plain,
sK37 = sK35,
inference(cnf_transformation,[],[f302]) ).
fof(f462,plain,
( nil = sK37
| ssList(sK41) ),
inference(cnf_transformation,[],[f302]) ).
fof(f815,plain,
~ ssList(sK41),
inference(trivial_inequality_removal,[],[f813]) ).
fof(f813,plain,
( ~ ssList(sK41)
| sK35 != sK35 ),
inference(superposition,[],[f812,f619]) ).
fof(f619,plain,
app(sF62,sK41) = sK35,
inference(backward_demodulation,[],[f597,f618]) ).
fof(f618,plain,
sF63 = sK35,
inference(subsumption_resolution,[],[f617,f459]) ).
fof(f617,plain,
( nil = sK35
| sF63 = sK35 ),
inference(forward_demodulation,[],[f613,f466]) ).
fof(f613,plain,
( sF63 = sK35
| nil = sK37 ),
inference(backward_demodulation,[],[f598,f466]) ).
fof(f598,plain,
( nil = sK37
| sK37 = sF63 ),
inference(definition_folding,[],[f464,f597,f596,f595]) ).
fof(f595,plain,
cons(sK39,nil) = sF61,
introduced(function_definition,[]) ).
fof(f596,plain,
sF62 = app(sK40,sF61),
introduced(function_definition,[]) ).
fof(f464,plain,
( sK37 = app(app(sK40,cons(sK39,nil)),sK41)
| nil = sK37 ),
inference(cnf_transformation,[],[f302]) ).
fof(f597,plain,
sF63 = app(sF62,sK41),
introduced(function_definition,[]) ).
fof(f812,plain,
! [X1] :
( app(sF62,X1) != sK35
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f811,f614]) ).
fof(f614,plain,
ssList(sK40),
inference(subsumption_resolution,[],[f610,f459]) ).
fof(f610,plain,
( nil = sK35
| ssList(sK40) ),
inference(backward_demodulation,[],[f461,f466]) ).
fof(f461,plain,
( ssList(sK40)
| nil = sK37 ),
inference(cnf_transformation,[],[f302]) ).
fof(f811,plain,
! [X1] :
( ~ ssList(sK40)
| app(sF62,X1) != sK35
| ~ ssList(X1) ),
inference(superposition,[],[f809,f596]) ).
fof(f809,plain,
! [X0,X1] :
( app(app(X0,sF61),X1) != sK35
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f808]) ).
fof(f808,plain,
! [X0,X1] :
( ~ ssList(X1)
| app(app(X0,sF61),X1) != sK35
| ~ ssList(X0)
| app(app(X0,sF61),X1) != sK35 ),
inference(forward_demodulation,[],[f807,f595]) ).
fof(f807,plain,
! [X0,X1] :
( ~ ssList(X1)
| app(app(X0,cons(sK39,nil)),X1) != sK35
| app(app(X0,sF61),X1) != sK35
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f806,f616]) ).
fof(f616,plain,
ssItem(sK39),
inference(subsumption_resolution,[],[f609,f459]) ).
fof(f609,plain,
( ssItem(sK39)
| nil = sK35 ),
inference(backward_demodulation,[],[f460,f466]) ).
fof(f460,plain,
( ssItem(sK39)
| nil = sK37 ),
inference(cnf_transformation,[],[f302]) ).
fof(f806,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(sK39)
| app(app(X0,cons(sK39,nil)),X1) != sK35
| ~ ssList(X0)
| app(app(X0,sF61),X1) != sK35 ),
inference(duplicate_literal_removal,[],[f805]) ).
fof(f805,plain,
! [X0,X1] :
( app(app(X0,sF61),X1) != sK35
| ~ ssList(X0)
| ~ ssList(X0)
| ~ ssList(X1)
| app(app(X0,cons(sK39,nil)),X1) != sK35
| ~ ssList(X1)
| ~ ssItem(sK39) ),
inference(resolution,[],[f804,f455]) ).
fof(f455,plain,
! [X10,X8,X9] :
( ssItem(sK42(X8,X9,X10))
| ~ ssList(X9)
| ~ ssItem(X8)
| app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10) ),
inference(cnf_transformation,[],[f302]) ).
fof(f804,plain,
! [X0,X1] :
( ~ ssItem(sK42(sK39,X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| app(app(X0,sF61),X1) != sK35 ),
inference(subsumption_resolution,[],[f803,f629]) ).
fof(f629,plain,
! [X2,X3] :
( ~ leq(sK39,sK42(sK39,X2,X3))
| app(app(X2,sF61),X3) != sK35
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(subsumption_resolution,[],[f624,f616]) ).
fof(f624,plain,
! [X2,X3] :
( ~ ssItem(sK39)
| ~ ssList(X3)
| ~ leq(sK39,sK42(sK39,X2,X3))
| app(app(X2,sF61),X3) != sK35
| ~ ssList(X2) ),
inference(superposition,[],[f457,f595]) ).
fof(f457,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8)
| ~ leq(X8,sK42(X8,X9,X10)) ),
inference(cnf_transformation,[],[f302]) ).
fof(f803,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssList(X0)
| app(app(X0,sF61),X1) != sK35
| ~ ssItem(sK42(sK39,X0,X1))
| leq(sK39,sK42(sK39,X0,X1)) ),
inference(subsumption_resolution,[],[f802,f616]) ).
fof(f802,plain,
! [X0,X1] :
( leq(sK39,sK42(sK39,X0,X1))
| ~ ssItem(sK42(sK39,X0,X1))
| ~ ssList(X1)
| ~ ssItem(sK39)
| ~ ssList(X0)
| app(app(X0,sF61),X1) != sK35 ),
inference(resolution,[],[f357,f627]) ).
fof(f627,plain,
! [X0,X1] :
( lt(sK39,sK42(sK39,X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| app(app(X0,sF61),X1) != sK35 ),
inference(subsumption_resolution,[],[f623,f616]) ).
fof(f623,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(sK39)
| app(app(X0,sF61),X1) != sK35
| ~ ssList(X1)
| lt(sK39,sK42(sK39,X0,X1)) ),
inference(superposition,[],[f458,f595]) ).
fof(f458,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK35
| ~ ssList(X10)
| ~ ssItem(X8)
| lt(X8,sK42(X8,X9,X10))
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f302]) ).
fof(f357,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f233]) ).
fof(f233,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) ) )
| ~ ssItem(X0) ),
inference(flattening,[],[f232]) ).
fof(f232,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) ) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f167,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC241+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 : n025.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:46:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.47 % (25947)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.20/0.47 % (25919)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.20/0.50 % (25939)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.50 % (25931)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.20/0.51 % (25922)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.20/0.51 % (25928)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.20/0.52 % (25919)Instruction limit reached!
% 0.20/0.52 % (25919)------------------------------
% 0.20/0.52 % (25919)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (25919)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (25919)Termination reason: Unknown
% 0.20/0.52 % (25919)Termination phase: Saturation
% 0.20/0.52
% 0.20/0.52 % (25919)Memory used [KB]: 6652
% 0.20/0.52 % (25919)Time elapsed: 0.096 s
% 0.20/0.52 % (25919)Instructions burned: 51 (million)
% 0.20/0.52 % (25919)------------------------------
% 0.20/0.52 % (25919)------------------------------
% 0.20/0.53 % (25942)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53 % (25916)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.20/0.53 % (25940)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.20/0.53 % (25945)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.20/0.53 % (25917)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.20/0.53 % (25920)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (25924)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (25923)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.20/0.53 % (25924)Instruction limit reached!
% 0.20/0.53 % (25924)------------------------------
% 0.20/0.53 % (25924)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (25924)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (25924)Termination reason: Unknown
% 0.20/0.53 % (25924)Termination phase: Property scanning
% 0.20/0.53
% 0.20/0.53 % (25924)Memory used [KB]: 1279
% 0.20/0.53 % (25924)Time elapsed: 0.005 s
% 0.20/0.53 % (25924)Instructions burned: 7 (million)
% 0.20/0.53 % (25924)------------------------------
% 0.20/0.53 % (25924)------------------------------
% 0.20/0.54 % (25944)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.20/0.54 % (25943)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54 % (25933)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.20/0.54 % (25946)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54 % (25936)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.20/0.54 % (25934)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.54 % (25925)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.20/0.54 % (25927)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (25925)Instruction limit reached!
% 0.20/0.54 % (25925)------------------------------
% 0.20/0.54 % (25925)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (25925)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (25925)Termination reason: Unknown
% 0.20/0.54 % (25925)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (25925)Memory used [KB]: 1151
% 0.20/0.54 % (25925)Time elapsed: 0.003 s
% 0.20/0.54 % (25925)Instructions burned: 3 (million)
% 0.20/0.54 % (25925)------------------------------
% 0.20/0.54 % (25925)------------------------------
% 0.20/0.55 % (25935)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55 % (25929)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.20/0.55 % (25937)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.20/0.56 % (25922)Instruction limit reached!
% 0.20/0.56 % (25922)------------------------------
% 0.20/0.56 % (25922)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (25930)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.56 % (25918)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.20/0.56 TRYING [1]
% 0.20/0.56 TRYING [2]
% 0.20/0.57 % (25941)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.20/0.57 % (25932)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.20/0.58 % (25926)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.20/0.58 % (25922)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (25922)Termination reason: Unknown
% 0.20/0.58 % (25922)Termination phase: Saturation
% 0.20/0.58
% 0.20/0.58 % (25922)Memory used [KB]: 6396
% 0.20/0.58 % (25922)Time elapsed: 0.100 s
% 0.20/0.58 % (25922)Instructions burned: 49 (million)
% 0.20/0.58 % (25922)------------------------------
% 0.20/0.58 % (25922)------------------------------
% 1.79/0.58 % (25945)First to succeed.
% 1.79/0.59 % (25945)Refutation found. Thanks to Tanya!
% 1.79/0.59 % SZS status Theorem for theBenchmark
% 1.79/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.79/0.59 % (25945)------------------------------
% 1.79/0.59 % (25945)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.59 % (25945)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.59 % (25945)Termination reason: Refutation
% 1.79/0.59
% 1.79/0.59 % (25945)Memory used [KB]: 1663
% 1.79/0.59 % (25945)Time elapsed: 0.190 s
% 1.79/0.59 % (25945)Instructions burned: 26 (million)
% 1.79/0.59 % (25945)------------------------------
% 1.79/0.59 % (25945)------------------------------
% 1.79/0.59 % (25914)Success in time 0.234 s
%------------------------------------------------------------------------------