TSTP Solution File: SWC168+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n029.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 : Tue May 21 04:36:45 EDT 2024
% Result : Theorem 1.06s 0.87s
% Output : Refutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 28
% Syntax : Number of formulae : 106 ( 16 unt; 0 def)
% Number of atoms : 885 ( 211 equ)
% Maximal formula atoms : 64 ( 8 avg)
% Number of connectives : 1228 ( 449 ~; 391 |; 321 &)
% ( 11 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 394 ( 241 !; 153 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2584,plain,
$false,
inference(avatar_sat_refutation,[],[f563,f586,f659,f1166,f2546]) ).
fof(f2546,plain,
( ~ spl46_13
| spl46_23 ),
inference(avatar_contradiction_clause,[],[f2545]) ).
fof(f2545,plain,
( $false
| ~ spl46_13
| spl46_23 ),
inference(subsumption_resolution,[],[f2544,f251]) ).
fof(f251,plain,
ssList(sK8),
inference(cnf_transformation,[],[f185]) ).
fof(f185,plain,
( ( nil != sK8
| nil = sK9 )
& ~ neq(sK10,sK11)
& sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13)
& ssList(sK13)
& ssList(sK12)
& ssItem(sK11)
& ssItem(sK10)
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != sK15
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != sK14
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& sK9 = app(app(sK14,sK8),sK15)
& ssList(sK15)
& ssList(sK14)
& sK6 = sK8
& sK7 = sK9
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15])],[f99,f184,f183,f182,f181,f180,f179,f178,f177,f176,f175]) ).
fof(f175,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK8
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& app(app(X8,sK8),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f178,plain,
( ? [X3] :
( ( nil != sK8
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& app(app(X8,sK8),X9) = X3
& ssList(X9) )
& ssList(X8) )
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
=> ( ( nil != sK8
| nil = sK9 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& app(app(X8,sK8),X9) = sK9
& ssList(X9) )
& ssList(X8) )
& sK6 = sK8
& sK7 = sK9
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f179,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(sK10,X5)
& sK6 = app(app(app(X6,cons(sK10,nil)),cons(X5,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f180,plain,
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(sK10,X5)
& sK6 = app(app(app(X6,cons(sK10,nil)),cons(X5,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
=> ( ? [X6] :
( ? [X7] :
( ~ neq(sK10,sK11)
& sK6 = app(app(app(X6,cons(sK10,nil)),cons(sK11,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
( ? [X6] :
( ? [X7] :
( ~ neq(sK10,sK11)
& sK6 = app(app(app(X6,cons(sK10,nil)),cons(sK11,nil)),X7)
& ssList(X7) )
& ssList(X6) )
=> ( ? [X7] :
( ~ neq(sK10,sK11)
& sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),X7)
& ssList(X7) )
& ssList(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
( ? [X7] :
( ~ neq(sK10,sK11)
& sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),X7)
& ssList(X7) )
=> ( ~ neq(sK10,sK11)
& sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13)
& ssList(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f183,plain,
( ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& app(app(X8,sK8),X9) = sK9
& ssList(X9) )
& ssList(X8) )
=> ( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != sK14
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& sK9 = app(app(sK14,sK8),X9)
& ssList(X9) )
& ssList(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != sK14
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& sK9 = app(app(sK14,sK8),X9)
& ssList(X9) )
=> ( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK8
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != sK15
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != sK8
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != sK14
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(sK8)
& sK9 = app(app(sK14,sK8),sK15)
& ssList(sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ~ neq(X4,X5)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ? [X8] :
( ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ! [X17] :
( ~ lt(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) )
| app(X15,cons(X14,nil)) != X8
| ~ ssList(X15) )
| ~ ssItem(X14) )
& strictorderedP(X2)
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& X0 = X2
& X1 = X3
& 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] :
( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( neq(X4,X5)
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X0
| ~ ssList(X7) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( lt(X14,X16)
& app(cons(X16,nil),X17) = X2
& ssList(X17) )
& ssItem(X16) )
& app(X15,cons(X14,nil)) = X8
& ssList(X15) )
& ssItem(X14) )
| ~ strictorderedP(X2)
| app(app(X8,X2),X9) != X3
| ~ ssList(X9) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssList(X16)
=> ! [X17] :
( neq(X14,X15)
| app(app(app(X16,cons(X14,nil)),cons(X15,nil)),X17) != X0
| ~ ssList(X17) ) ) ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssList(X16)
=> ! [X17] :
( neq(X14,X15)
| app(app(app(X16,cons(X14,nil)),cons(X15,nil)),X17) != X0
| ~ ssList(X17) ) ) ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f2544,plain,
( ~ ssList(sK8)
| ~ spl46_13
| spl46_23 ),
inference(subsumption_resolution,[],[f2543,f873]) ).
fof(f873,plain,
( ~ lt(sK10,sK10)
| spl46_23 ),
inference(avatar_component_clause,[],[f872]) ).
fof(f872,plain,
( spl46_23
<=> lt(sK10,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl46_23])]) ).
fof(f2543,plain,
( lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f2542,f261]) ).
fof(f261,plain,
ssItem(sK10),
inference(cnf_transformation,[],[f185]) ).
fof(f2542,plain,
( ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f2541,f263]) ).
fof(f263,plain,
ssList(sK12),
inference(cnf_transformation,[],[f185]) ).
fof(f2541,plain,
( ~ ssList(sK12)
| ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f2540,f294]) ).
fof(f294,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f2540,plain,
( ~ ssList(nil)
| ~ ssList(sK12)
| ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f2539,f264]) ).
fof(f264,plain,
ssList(sK13),
inference(cnf_transformation,[],[f185]) ).
fof(f2539,plain,
( ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssList(sK12)
| ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f2516,f258]) ).
fof(f258,plain,
strictorderedP(sK8),
inference(cnf_transformation,[],[f185]) ).
fof(f2516,plain,
( ~ strictorderedP(sK8)
| ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssList(sK12)
| ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(duplicate_literal_removal,[],[f2500]) ).
fof(f2500,plain,
( ~ strictorderedP(sK8)
| ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssList(sK12)
| ~ ssItem(sK10)
| ~ ssItem(sK10)
| lt(sK10,sK10)
| ~ ssList(sK8)
| ~ spl46_13 ),
inference(superposition,[],[f395,f1702]) ).
fof(f1702,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f1701,f264]) ).
fof(f1701,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
| ~ ssList(sK13)
| ~ spl46_13 ),
inference(subsumption_resolution,[],[f1688,f261]) ).
fof(f1688,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
| ~ ssItem(sK10)
| ~ ssList(sK13)
| ~ spl46_13 ),
inference(superposition,[],[f512,f284]) ).
fof(f284,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f512,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
| ~ spl46_13 ),
inference(avatar_component_clause,[],[f510]) ).
fof(f510,plain,
( spl46_13
<=> sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13)) ),
introduced(avatar_definition,[new_symbols(naming,[spl46_13])]) ).
fof(f395,plain,
! [X10,X8,X6,X9,X7] :
( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| lt(X6,X7)
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f310]) ).
fof(f310,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f208]) ).
fof(f208,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),sK24(X0))) = X0
& ssList(sK24(X0))
& ssList(sK23(X0))
& ssList(sK22(X0))
& ssItem(sK21(X0))
& ssItem(sK20(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24])],[f202,f207,f206,f205,f204,f203]) ).
fof(f203,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),X2)
& app(app(X3,cons(sK20(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(sK20(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f204,plain,
! [X0] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),X2)
& app(app(X3,cons(sK20(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(X3,cons(sK20(X0),X4)),cons(sK21(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(sK21(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f205,plain,
! [X0] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(X3,cons(sK20(X0),X4)),cons(sK21(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),X4)),cons(sK21(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(sK22(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f206,plain,
! [X0] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),X4)),cons(sK21(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),X5)) = X0
& ssList(X5) )
& ssList(sK23(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f207,plain,
! [X0] :
( ? [X5] :
( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),X5)) = X0
& ssList(X5) )
=> ( ~ lt(sK20(X0),sK21(X0))
& app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),sK24(X0))) = X0
& ssList(sK24(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f202,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f201]) ).
fof(f201,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax12) ).
fof(f1166,plain,
~ spl46_23,
inference(avatar_contradiction_clause,[],[f1165]) ).
fof(f1165,plain,
( $false
| ~ spl46_23 ),
inference(subsumption_resolution,[],[f1156,f261]) ).
fof(f1156,plain,
( ~ ssItem(sK10)
| ~ spl46_23 ),
inference(resolution,[],[f874,f405]) ).
fof(f405,plain,
! [X1] :
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f392]) ).
fof(f392,plain,
! [X1] :
( ~ lt(X1,X1)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f295]) ).
fof(f295,plain,
! [X0,X1] :
( X0 != X1
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f196]) ).
fof(f196,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) )
| ~ ssItem(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/sandbox2/benchmark/theBenchmark.p',ax93) ).
fof(f874,plain,
( lt(sK10,sK10)
| ~ spl46_23 ),
inference(avatar_component_clause,[],[f872]) ).
fof(f659,plain,
( ~ spl46_11
| spl46_12 ),
inference(avatar_contradiction_clause,[],[f658]) ).
fof(f658,plain,
( $false
| ~ spl46_11
| spl46_12 ),
inference(subsumption_resolution,[],[f657,f263]) ).
fof(f657,plain,
( ~ ssList(sK12)
| ~ spl46_11
| spl46_12 ),
inference(subsumption_resolution,[],[f655,f499]) ).
fof(f499,plain,
( ssList(cons(sK10,nil))
| ~ spl46_11 ),
inference(avatar_component_clause,[],[f498]) ).
fof(f498,plain,
( spl46_11
<=> ssList(cons(sK10,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl46_11])]) ).
fof(f655,plain,
( ~ ssList(cons(sK10,nil))
| ~ ssList(sK12)
| spl46_12 ),
inference(resolution,[],[f508,f289]) ).
fof(f289,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f508,plain,
( ~ ssList(app(sK12,cons(sK10,nil)))
| spl46_12 ),
inference(avatar_component_clause,[],[f506]) ).
fof(f506,plain,
( spl46_12
<=> ssList(app(sK12,cons(sK10,nil))) ),
introduced(avatar_definition,[new_symbols(naming,[spl46_12])]) ).
fof(f586,plain,
spl46_11,
inference(avatar_contradiction_clause,[],[f585]) ).
fof(f585,plain,
( $false
| spl46_11 ),
inference(subsumption_resolution,[],[f584,f294]) ).
fof(f584,plain,
( ~ ssList(nil)
| spl46_11 ),
inference(subsumption_resolution,[],[f582,f261]) ).
fof(f582,plain,
( ~ ssItem(sK10)
| ~ ssList(nil)
| spl46_11 ),
inference(resolution,[],[f500,f278]) ).
fof(f278,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
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(f500,plain,
( ~ ssList(cons(sK10,nil))
| spl46_11 ),
inference(avatar_component_clause,[],[f498]) ).
fof(f563,plain,
( ~ spl46_12
| spl46_13
| ~ spl46_11 ),
inference(avatar_split_clause,[],[f562,f498,f510,f506]) ).
fof(f562,plain,
( ~ ssList(cons(sK10,nil))
| sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
| ~ ssList(app(sK12,cons(sK10,nil))) ),
inference(forward_demodulation,[],[f561,f418]) ).
fof(f418,plain,
sK10 = sK11,
inference(subsumption_resolution,[],[f417,f261]) ).
fof(f417,plain,
( sK10 = sK11
| ~ ssItem(sK10) ),
inference(subsumption_resolution,[],[f415,f262]) ).
fof(f262,plain,
ssItem(sK11),
inference(cnf_transformation,[],[f185]) ).
fof(f415,plain,
( sK10 = sK11
| ~ ssItem(sK11)
| ~ ssItem(sK10) ),
inference(resolution,[],[f266,f293]) ).
fof(f293,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f195]) ).
fof(f195,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f266,plain,
~ neq(sK10,sK11),
inference(cnf_transformation,[],[f185]) ).
fof(f561,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
| ~ ssList(cons(sK11,nil))
| ~ ssList(app(sK12,cons(sK10,nil))) ),
inference(forward_demodulation,[],[f560,f418]) ).
fof(f560,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK11,nil),sK13))
| ~ ssList(cons(sK11,nil))
| ~ ssList(app(sK12,cons(sK10,nil))) ),
inference(subsumption_resolution,[],[f488,f264]) ).
fof(f488,plain,
( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK11,nil),sK13))
| ~ ssList(sK13)
| ~ ssList(cons(sK11,nil))
| ~ ssList(app(sK12,cons(sK10,nil))) ),
inference(superposition,[],[f283,f385]) ).
fof(f385,plain,
sK8 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13),
inference(definition_unfolding,[],[f265,f254]) ).
fof(f254,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f185]) ).
fof(f265,plain,
sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13),
inference(cnf_transformation,[],[f185]) ).
fof(f283,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.29 % Computer : n029.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 03:26:53 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.29 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.76 % (2975)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.76 % (2977)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.56/0.76 % (2978)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.56/0.76 % (2980)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.56/0.76 % (2979)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.76 % (2982)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.56/0.76 % (2981)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.59/0.77 % (2976)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.59/0.77 % (2975)Instruction limit reached!
% 0.59/0.77 % (2975)------------------------------
% 0.59/0.77 % (2975)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (2975)Termination reason: Unknown
% 0.59/0.77 % (2975)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (2975)Memory used [KB]: 1473
% 0.59/0.77 % (2975)Time elapsed: 0.015 s
% 0.59/0.77 % (2975)Instructions burned: 35 (million)
% 0.59/0.77 % (2975)------------------------------
% 0.59/0.77 % (2975)------------------------------
% 0.59/0.78 % (2983)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.59/0.78 % (2979)Instruction limit reached!
% 0.59/0.78 % (2979)------------------------------
% 0.59/0.78 % (2979)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (2979)Termination reason: Unknown
% 0.59/0.78 % (2979)Termination phase: Saturation
% 0.59/0.78
% 0.59/0.78 % (2979)Memory used [KB]: 2094
% 0.59/0.78 % (2979)Time elapsed: 0.019 s
% 0.59/0.78 % (2979)Instructions burned: 35 (million)
% 0.59/0.78 % (2979)------------------------------
% 0.59/0.78 % (2979)------------------------------
% 0.59/0.78 % (2980)Instruction limit reached!
% 0.59/0.78 % (2980)------------------------------
% 0.59/0.78 % (2980)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (2980)Termination reason: Unknown
% 0.59/0.78 % (2980)Termination phase: Saturation
% 0.59/0.78
% 0.59/0.78 % (2980)Memory used [KB]: 1600
% 0.59/0.78 % (2980)Time elapsed: 0.045 s
% 0.59/0.78 % (2980)Instructions burned: 45 (million)
% 0.59/0.78 % (2980)------------------------------
% 0.59/0.78 % (2980)------------------------------
% 0.59/0.79 % (2984)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.59/0.79 % (2985)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.59/0.79 % (2982)Instruction limit reached!
% 0.59/0.79 % (2982)------------------------------
% 0.59/0.79 % (2982)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (2982)Termination reason: Unknown
% 0.59/0.79 % (2982)Termination phase: Saturation
% 0.59/0.79
% 0.59/0.79 % (2982)Memory used [KB]: 1726
% 0.59/0.79 % (2982)Time elapsed: 0.028 s
% 0.59/0.79 % (2982)Instructions burned: 57 (million)
% 0.59/0.79 % (2982)------------------------------
% 0.59/0.79 % (2982)------------------------------
% 0.59/0.79 % (2978)Instruction limit reached!
% 0.59/0.79 % (2978)------------------------------
% 0.59/0.79 % (2978)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (2978)Termination reason: Unknown
% 0.59/0.79 % (2978)Termination phase: Saturation
% 0.59/0.79
% 0.59/0.79 % (2978)Memory used [KB]: 1755
% 0.59/0.79 % (2978)Time elapsed: 0.044 s
% 0.59/0.79 % (2978)Instructions burned: 36 (million)
% 0.59/0.79 % (2978)------------------------------
% 0.59/0.79 % (2978)------------------------------
% 0.59/0.79 % (2986)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.59/0.79 % (2976)Instruction limit reached!
% 0.59/0.79 % (2976)------------------------------
% 0.59/0.79 % (2976)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (2976)Termination reason: Unknown
% 0.59/0.79 % (2976)Termination phase: Saturation
% 0.59/0.79
% 0.59/0.79 % (2976)Memory used [KB]: 2126
% 0.59/0.79 % (2976)Time elapsed: 0.052 s
% 0.59/0.79 % (2976)Instructions burned: 52 (million)
% 0.59/0.79 % (2976)------------------------------
% 0.59/0.79 % (2976)------------------------------
% 0.59/0.80 % (2987)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.59/0.80 % (2981)Instruction limit reached!
% 0.59/0.80 % (2981)------------------------------
% 0.59/0.80 % (2981)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (2981)Termination reason: Unknown
% 0.59/0.80 % (2981)Termination phase: Saturation
% 0.59/0.80
% 0.59/0.80 % (2981)Memory used [KB]: 2044
% 0.59/0.80 % (2981)Time elapsed: 0.039 s
% 0.59/0.80 % (2981)Instructions burned: 84 (million)
% 0.59/0.80 % (2981)------------------------------
% 0.59/0.80 % (2981)------------------------------
% 0.59/0.80 % (2988)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.59/0.80 % (2977)Instruction limit reached!
% 0.59/0.80 % (2977)------------------------------
% 0.59/0.80 % (2977)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (2977)Termination reason: Unknown
% 0.59/0.80 % (2977)Termination phase: Saturation
% 0.59/0.80
% 0.59/0.80 % (2977)Memory used [KB]: 1888
% 0.59/0.80 % (2977)Time elapsed: 0.042 s
% 0.59/0.80 % (2977)Instructions burned: 79 (million)
% 0.59/0.80 % (2977)------------------------------
% 0.59/0.80 % (2977)------------------------------
% 0.59/0.80 % (2983)Instruction limit reached!
% 0.59/0.80 % (2983)------------------------------
% 0.59/0.80 % (2983)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (2983)Termination reason: Unknown
% 0.59/0.80 % (2983)Termination phase: Saturation
% 0.59/0.80
% 0.59/0.80 % (2983)Memory used [KB]: 2348
% 0.59/0.80 % (2983)Time elapsed: 0.047 s
% 0.59/0.80 % (2983)Instructions burned: 55 (million)
% 0.59/0.80 % (2983)------------------------------
% 0.59/0.80 % (2983)------------------------------
% 0.59/0.80 % (2984)Instruction limit reached!
% 0.59/0.80 % (2984)------------------------------
% 0.59/0.80 % (2984)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (2984)Termination reason: Unknown
% 0.59/0.80 % (2984)Termination phase: Saturation
% 0.59/0.80
% 0.59/0.80 % (2984)Memory used [KB]: 1953
% 0.59/0.80 % (2984)Time elapsed: 0.043 s
% 0.59/0.80 % (2984)Instructions burned: 51 (million)
% 0.59/0.80 % (2984)------------------------------
% 0.59/0.80 % (2984)------------------------------
% 0.59/0.80 % (2989)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2994ds/243Mi)
% 0.59/0.80 % (2990)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2994ds/117Mi)
% 0.59/0.81 % (2992)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2994ds/93Mi)
% 0.59/0.82 % (2986)Instruction limit reached!
% 0.59/0.82 % (2986)------------------------------
% 0.59/0.82 % (2986)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.82 % (2986)Termination reason: Unknown
% 0.59/0.82 % (2986)Termination phase: Saturation
% 0.59/0.82
% 0.59/0.82 % (2986)Memory used [KB]: 1821
% 0.59/0.82 % (2986)Time elapsed: 0.051 s
% 0.59/0.82 % (2986)Instructions burned: 53 (million)
% 0.59/0.82 % (2986)------------------------------
% 0.59/0.82 % (2986)------------------------------
% 0.59/0.82 % (2991)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2994ds/143Mi)
% 0.59/0.82 % (2993)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2994ds/62Mi)
% 0.59/0.82 % (2988)Instruction limit reached!
% 0.59/0.82 % (2988)------------------------------
% 0.59/0.82 % (2988)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.82 % (2988)Termination reason: Unknown
% 0.59/0.82 % (2988)Termination phase: Saturation
% 0.59/0.82
% 0.59/0.82 % (2988)Memory used [KB]: 2097
% 0.59/0.82 % (2988)Time elapsed: 0.023 s
% 0.59/0.82 % (2988)Instructions burned: 43 (million)
% 0.59/0.82 % (2988)------------------------------
% 0.59/0.82 % (2988)------------------------------
% 0.90/0.84 % (2993)Instruction limit reached!
% 0.90/0.84 % (2993)------------------------------
% 0.90/0.84 % (2993)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.90/0.84 % (2993)Termination reason: Unknown
% 0.90/0.84 % (2993)Termination phase: Saturation
% 0.90/0.84
% 0.90/0.85 % (2993)Memory used [KB]: 2290
% 0.90/0.85 % (2993)Time elapsed: 0.027 s
% 0.90/0.85 % (2993)Instructions burned: 62 (million)
% 0.90/0.85 % (2993)------------------------------
% 0.90/0.85 % (2993)------------------------------
% 0.90/0.85 % (2994)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on theBenchmark for (2994ds/32Mi)
% 0.90/0.85 % (2995)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on theBenchmark for (2994ds/1919Mi)
% 0.90/0.85 % (2990)Instruction limit reached!
% 0.90/0.85 % (2990)------------------------------
% 0.90/0.85 % (2990)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.90/0.85 % (2990)Termination reason: Unknown
% 0.90/0.85 % (2990)Termination phase: Saturation
% 0.90/0.85
% 0.90/0.85 % (2990)Memory used [KB]: 1757
% 0.90/0.85 % (2990)Time elapsed: 0.049 s
% 0.90/0.85 % (2990)Instructions burned: 117 (million)
% 0.90/0.85 % (2990)------------------------------
% 0.90/0.85 % (2990)------------------------------
% 0.90/0.86 % (2996)ott-32_5:1_sil=4000:sp=occurrence:urr=full:rp=on:nwc=5.0:newcnf=on:st=5.0:s2pl=on:i=55:sd=2:ins=2:ss=included:rawr=on:anc=none:sos=on:s2agt=8:spb=intro:ep=RS:avsq=on:avsqr=27,155:lma=on_0 on theBenchmark for (2994ds/55Mi)
% 0.90/0.86 % (2992)Instruction limit reached!
% 0.90/0.86 % (2992)------------------------------
% 0.90/0.86 % (2992)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.90/0.86 % (2992)Termination reason: Unknown
% 0.90/0.86 % (2992)Termination phase: Saturation
% 0.90/0.86
% 0.90/0.86 % (2992)Memory used [KB]: 2132
% 0.90/0.86 % (2992)Time elapsed: 0.055 s
% 0.90/0.86 % (2992)Instructions burned: 94 (million)
% 0.90/0.86 % (2992)------------------------------
% 0.90/0.86 % (2992)------------------------------
% 0.90/0.86 % (2994)Instruction limit reached!
% 0.90/0.86 % (2994)------------------------------
% 0.90/0.86 % (2994)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.90/0.86 % (2994)Termination reason: Unknown
% 0.90/0.86 % (2994)Termination phase: Saturation
% 0.90/0.86
% 0.90/0.86 % (2994)Memory used [KB]: 1483
% 0.90/0.86 % (2994)Time elapsed: 0.046 s
% 0.90/0.86 % (2994)Instructions burned: 32 (million)
% 0.90/0.86 % (2994)------------------------------
% 0.90/0.86 % (2994)------------------------------
% 0.90/0.86 % (2997)lrs-1011_1:1_sil=2000:sos=on:urr=on:i=53:sd=1:bd=off:ins=3:av=off:ss=axioms:sgt=16:gsp=on:lsd=10_0 on theBenchmark for (2994ds/53Mi)
% 0.90/0.86 % (2998)lrs+1011_6929:65536_anc=all_dependent:sil=2000:fde=none:plsqc=1:plsq=on:plsqr=19,8:plsql=on:nwc=3.0:i=46:afp=4000:ep=R:nm=3:fsr=off:afr=on:aer=off:gsp=on_0 on theBenchmark for (2994ds/46Mi)
% 0.90/0.87 % (2987)First to succeed.
% 1.06/0.87 % (2987)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2973"
% 1.06/0.87 % (2987)Refutation found. Thanks to Tanya!
% 1.06/0.87 % SZS status Theorem for theBenchmark
% 1.06/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 1.06/0.87 % (2987)------------------------------
% 1.06/0.87 % (2987)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.06/0.87 % (2987)Termination reason: Refutation
% 1.06/0.87
% 1.06/0.87 % (2987)Memory used [KB]: 2391
% 1.06/0.87 % (2987)Time elapsed: 0.102 s
% 1.06/0.87 % (2987)Instructions burned: 149 (million)
% 1.06/0.87 % (2973)Success in time 0.571 s
% 1.06/0.87 % Vampire---4.8 exiting
%------------------------------------------------------------------------------