TSTP Solution File: SWC402+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC402+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:50:52 EDT 2024
% Result : Theorem 0.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 14 unt; 0 def)
% Number of atoms : 563 ( 140 equ)
% Maximal formula atoms : 58 ( 10 avg)
% Number of connectives : 829 ( 318 ~; 280 |; 203 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 241 ( 165 !; 76 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f632,plain,
$false,
inference(avatar_sat_refutation,[],[f337,f352,f631]) ).
fof(f631,plain,
~ spl19_11,
inference(avatar_contradiction_clause,[],[f630]) ).
fof(f630,plain,
( $false
| ~ spl19_11 ),
inference(subsumption_resolution,[],[f629,f249]) ).
fof(f249,plain,
memberP(sK2,sK4),
inference(definition_unfolding,[],[f188,f180]) ).
fof(f180,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ( nil != sK2
| nil = sK3 )
& ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& sK3 = app(app(sK5,sK2),sK6)
& ssList(sK6)
& ssList(sK5)
& 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])],[f99,f144,f143,f142,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& app(app(X5,sK2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& app(app(X5,sK2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& app(app(X5,sK2),X6) = sK3
& ssList(X6) )
& ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
=> ( ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& app(app(X5,sK2),X6) = sK3
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& sK3 = app(app(sK5,sK2),X6)
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& sK3 = app(app(sK5,sK2),X6)
& ssList(X6) )
=> ( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK2)
& sK3 = app(app(sK5,sK2),sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& 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] :
( memberP(X1,X4)
| ~ memberP(X0,X4)
| ~ ssItem(X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( leq(X9,X7)
& app(X10,cons(X9,nil)) = X2
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X11,X13)
& app(cons(X13,nil),X14) = X2
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X5
& ssList(X12) )
& ssItem(X11) )
| ~ totalorderedP(X2)
| app(app(X5,X2),X6) != X3
| ~ ssList(X6) ) )
| 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] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(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] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(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] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(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] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zZ32jVLPRr/Vampire---4.8_9894',co1) ).
fof(f188,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f145]) ).
fof(f629,plain,
( ~ memberP(sK2,sK4)
| ~ spl19_11 ),
inference(subsumption_resolution,[],[f628,f187]) ).
fof(f187,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f145]) ).
fof(f628,plain,
( ~ ssItem(sK4)
| ~ memberP(sK2,sK4)
| ~ spl19_11 ),
inference(resolution,[],[f627,f248]) ).
fof(f248,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f189,f179]) ).
fof(f179,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f145]) ).
fof(f189,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f145]) ).
fof(f627,plain,
( ! [X0] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(sK2,X0) )
| ~ spl19_11 ),
inference(subsumption_resolution,[],[f626,f181]) ).
fof(f181,plain,
ssList(sK5),
inference(cnf_transformation,[],[f145]) ).
fof(f626,plain,
( ! [X0] :
( ~ ssItem(X0)
| memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK5) )
| ~ spl19_11 ),
inference(subsumption_resolution,[],[f624,f177]) ).
fof(f177,plain,
ssList(sK2),
inference(cnf_transformation,[],[f145]) ).
fof(f624,plain,
( ! [X0] :
( ~ ssItem(X0)
| memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK2)
| ~ ssList(sK5) )
| ~ spl19_11 ),
inference(duplicate_literal_removal,[],[f623]) ).
fof(f623,plain,
( ! [X0] :
( ~ ssItem(X0)
| memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK2)
| ~ ssList(sK5)
| ~ ssItem(X0) )
| ~ spl19_11 ),
inference(resolution,[],[f336,f220]) ).
fof(f220,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zZ32jVLPRr/Vampire---4.8_9894',ax36) ).
fof(f336,plain,
( ! [X0] :
( ~ memberP(app(sK5,sK2),X0)
| ~ ssItem(X0)
| memberP(sK3,X0) )
| ~ spl19_11 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f335,plain,
( spl19_11
<=> ! [X0] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(app(sK5,sK2),X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_11])]) ).
fof(f352,plain,
spl19_3,
inference(avatar_contradiction_clause,[],[f351]) ).
fof(f351,plain,
( $false
| spl19_3 ),
inference(subsumption_resolution,[],[f350,f181]) ).
fof(f350,plain,
( ~ ssList(sK5)
| spl19_3 ),
inference(subsumption_resolution,[],[f349,f177]) ).
fof(f349,plain,
( ~ ssList(sK2)
| ~ ssList(sK5)
| spl19_3 ),
inference(resolution,[],[f292,f212]) ).
fof(f212,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/tmp/tmp.zZ32jVLPRr/Vampire---4.8_9894',ax26) ).
fof(f292,plain,
( ~ ssList(app(sK5,sK2))
| spl19_3 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f290,plain,
( spl19_3
<=> ssList(app(sK5,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_3])]) ).
fof(f337,plain,
( ~ spl19_3
| spl19_11 ),
inference(avatar_split_clause,[],[f333,f335,f290]) ).
fof(f333,plain,
! [X0] :
( memberP(sK3,X0)
| ~ memberP(app(sK5,sK2),X0)
| ~ ssList(app(sK5,sK2))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f281,f182]) ).
fof(f182,plain,
ssList(sK6),
inference(cnf_transformation,[],[f145]) ).
fof(f281,plain,
! [X0] :
( memberP(sK3,X0)
| ~ memberP(app(sK5,sK2),X0)
| ~ ssList(sK6)
| ~ ssList(app(sK5,sK2))
| ~ ssItem(X0) ),
inference(superposition,[],[f219,f183]) ).
fof(f183,plain,
sK3 = app(app(sK5,sK2),sK6),
inference(cnf_transformation,[],[f145]) ).
fof(f219,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC402+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % 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.10/0.31 % Computer : n012.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 20:23:38 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.31 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/tmp/tmp.zZ32jVLPRr/Vampire---4.8_9894
% 0.62/0.80 % (10004)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.62/0.80 % (10008)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.62/0.80 % (10006)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.62/0.80 % (10007)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.62/0.80 % (10005)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.62/0.80 % (10010)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.62/0.80 % (10009)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.62/0.80 % (10003)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.62/0.81 % (10008)First to succeed.
% 0.62/0.81 % (10008)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10002"
% 0.62/0.81 % (10008)Refutation found. Thanks to Tanya!
% 0.62/0.81 % SZS status Theorem for Vampire---4
% 0.62/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.81 % (10008)------------------------------
% 0.62/0.81 % (10008)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (10008)Termination reason: Refutation
% 0.62/0.81
% 0.62/0.81 % (10008)Memory used [KB]: 1373
% 0.62/0.81 % (10008)Time elapsed: 0.014 s
% 0.62/0.81 % (10008)Instructions burned: 23 (million)
% 0.62/0.81 % (10002)Success in time 0.488 s
% 0.62/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------