TSTP Solution File: SWC241+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC241+1 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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 : Sun May 5 09:49:40 EDT 2024
% Result : Theorem 0.59s 0.80s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 56 ( 5 unt; 0 def)
% Number of atoms : 531 ( 112 equ)
% Maximal formula atoms : 52 ( 9 avg)
% Number of connectives : 731 ( 256 ~; 236 |; 207 &)
% ( 7 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 191 ( 113 !; 78 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f321,plain,
$false,
inference(avatar_sat_refutation,[],[f255,f260,f265,f270,f271,f319]) ).
fof(f319,plain,
( ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(avatar_contradiction_clause,[],[f318]) ).
fof(f318,plain,
( $false
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f317,f264]) ).
fof(f264,plain,
( ssList(sK5)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl14_5
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_5])]) ).
fof(f317,plain,
( ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_4
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f316,f259]) ).
fof(f259,plain,
( ssList(sK6)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f257,plain,
( spl14_4
<=> ssList(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f316,plain,
( ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f314,f269]) ).
fof(f269,plain,
( ssItem(sK4)
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f267,plain,
( spl14_6
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_6])]) ).
fof(f314,plain,
( ~ ssItem(sK4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f312]) ).
fof(f312,plain,
( sK2 != sK2
| ~ ssItem(sK4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3 ),
inference(superposition,[],[f310,f254]) ).
fof(f254,plain,
( sK2 = app(app(sK5,cons(sK4,nil)),sK6)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl14_3
<=> sK2 = app(app(sK5,cons(sK4,nil)),sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f310,plain,
! [X2,X0,X1] :
( sK2 != app(app(X1,cons(X0,nil)),X2)
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f309,f231]) ).
fof(f231,plain,
! [X10,X8,X9] :
( ssItem(sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f172,f170]) ).
fof(f170,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ( ( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6)
& ssList(sK5)
& ssItem(sK4) )
| nil = sK2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( ~ leq(X8,sK7(X8,X9,X10))
& lt(X8,sK7(X8,X9,X10))
& memberP(X10,sK7(X8,X9,X10))
& memberP(X9,sK7(X8,X9,X10))
& ssItem(sK7(X8,X9,X10)) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f99,f144,f143,f142,f141,f140,f139,f138,f137]) ).
fof(f137,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(X6,X7)
| ~ memberP(sK5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(sK5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X6] :
( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(X6,X7)
| ~ memberP(sK5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(sK5,cons(sK4,nil)),X6)
& ssList(X6) )
=> ( ! [X7] :
( ~ leq(sK4,X7)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7)
| leq(X7,sK4)
| ~ ssItem(X7) )
& sK2 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
=> ( ~ leq(X8,sK7(X8,X9,X10))
& lt(X8,sK7(X8,X9,X10))
& memberP(X10,sK7(X8,X9,X10))
& memberP(X9,sK7(X8,X9,X10))
& ssItem(sK7(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& 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] :
( ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( leq(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ~ leq(X7,X4)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) ) ) )
& nil != X2 )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( leq(X8,X11)
| ~ lt(X8,X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11)
| ~ ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rPYXSMJpNU/Vampire---4.8_5996',co1) ).
fof(f172,plain,
! [X10,X8,X9] :
( ssItem(sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f145]) ).
fof(f309,plain,
! [X2,X0,X1] :
( ~ ssItem(sK7(X0,X1,X2))
| ~ ssItem(X0)
| sK2 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f308,f227]) ).
fof(f227,plain,
! [X10,X8,X9] :
( ~ leq(X8,sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f176,f170]) ).
fof(f176,plain,
! [X10,X8,X9] :
( ~ leq(X8,sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f145]) ).
fof(f308,plain,
! [X2,X0,X1] :
( leq(X0,sK7(X0,X1,X2))
| ~ ssItem(sK7(X0,X1,X2))
| ~ ssItem(X0)
| sK2 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f307]) ).
fof(f307,plain,
! [X2,X0,X1] :
( leq(X0,sK7(X0,X1,X2))
| ~ ssItem(sK7(X0,X1,X2))
| ~ ssItem(X0)
| sK2 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(resolution,[],[f220,f228]) ).
fof(f228,plain,
! [X10,X8,X9] :
( lt(X8,sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f175,f170]) ).
fof(f175,plain,
! [X10,X8,X9] :
( lt(X8,sK7(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f145]) ).
fof(f220,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,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,[],[f163]) ).
fof(f163,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,[],[f127]) ).
fof(f127,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/sandbox/tmp/tmp.rPYXSMJpNU/Vampire---4.8_5996',ax93) ).
fof(f271,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f232,f244]) ).
fof(f244,plain,
( spl14_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f232,plain,
nil != sK2,
inference(definition_unfolding,[],[f171,f170]) ).
fof(f171,plain,
nil != sK0,
inference(cnf_transformation,[],[f145]) ).
fof(f270,plain,
( spl14_1
| spl14_6 ),
inference(avatar_split_clause,[],[f177,f267,f244]) ).
fof(f177,plain,
( ssItem(sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
fof(f265,plain,
( spl14_1
| spl14_5 ),
inference(avatar_split_clause,[],[f178,f262,f244]) ).
fof(f178,plain,
( ssList(sK5)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
fof(f260,plain,
( spl14_1
| spl14_4 ),
inference(avatar_split_clause,[],[f179,f257,f244]) ).
fof(f179,plain,
( ssList(sK6)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
fof(f255,plain,
( spl14_1
| spl14_3 ),
inference(avatar_split_clause,[],[f180,f252,f244]) ).
fof(f180,plain,
( sK2 = app(app(sK5,cons(sK4,nil)),sK6)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC241+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.36 % Computer : n019.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Fri May 3 20:36:22 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.rPYXSMJpNU/Vampire---4.8_5996
% 0.59/0.79 % (6105)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 Vampire---4 for (2995ds/34Mi)
% 0.59/0.79 % (6111)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 Vampire---4 for (2995ds/83Mi)
% 0.59/0.79 % (6110)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.79 % (6107)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.79 % (6108)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.79 % (6106)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 Vampire---4 for (2995ds/51Mi)
% 0.59/0.79 % (6112)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.59/0.79 % (6109)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 Vampire---4 for (2995ds/34Mi)
% 0.59/0.80 % (6107)First to succeed.
% 0.59/0.80 % (6107)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6104"
% 0.59/0.80 % (6107)Refutation found. Thanks to Tanya!
% 0.59/0.80 % SZS status Theorem for Vampire---4
% 0.59/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.80 % (6107)------------------------------
% 0.59/0.80 % (6107)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (6107)Termination reason: Refutation
% 0.59/0.80
% 0.59/0.80 % (6107)Memory used [KB]: 1176
% 0.59/0.80 % (6107)Time elapsed: 0.009 s
% 0.59/0.80 % (6107)Instructions burned: 14 (million)
% 0.59/0.80 % (6104)Success in time 0.439 s
% 0.59/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------