TSTP Solution File: SWC247+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC247+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 : n020.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 May 1 04:00:50 EDT 2024
% Result : Theorem 0.56s 0.77s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 88 ( 10 unt; 0 def)
% Number of atoms : 616 ( 125 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 866 ( 338 ~; 304 |; 188 &)
% ( 7 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 205 ( 148 !; 57 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f850,plain,
$false,
inference(avatar_sat_refutation,[],[f599,f615,f651,f659,f694,f698,f840,f849]) ).
fof(f849,plain,
~ spl52_23,
inference(avatar_contradiction_clause,[],[f848]) ).
fof(f848,plain,
( $false
| ~ spl52_23 ),
inference(trivial_inequality_removal,[],[f845]) ).
fof(f845,plain,
( nil != nil
| ~ spl52_23 ),
inference(superposition,[],[f548,f839]) ).
fof(f839,plain,
( nil = sK49
| ~ spl52_23 ),
inference(avatar_component_clause,[],[f837]) ).
fof(f837,plain,
( spl52_23
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_23])]) ).
fof(f548,plain,
nil != sK49,
inference(definition_unfolding,[],[f536,f533]) ).
fof(f533,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ( ~ leq(X4,sK51(X4,X5,X6))
& lt(X4,sK51(X4,X5,X6))
& memberP(X6,sK51(X4,X5,X6))
& memberP(X5,sK51(X4,X5,X6))
& ssItem(sK51(X4,X5,X6)) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,sK49)
| ~ frontsegP(sK50,X8)
| ~ neq(sK49,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(sK49)
& frontsegP(sK50,sK49)
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51])],[f223,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [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) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != X0
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,sK49)
| ~ frontsegP(X3,X8)
| ~ neq(sK49,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(sK49)
& frontsegP(X3,sK49)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,sK49)
| ~ frontsegP(X3,X8)
| ~ neq(sK49,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(sK49)
& frontsegP(X3,sK49)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ! [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) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,sK49)
| ~ frontsegP(sK50,X8)
| ~ neq(sK49,X8)
| ~ ssList(X8) )
& nil != sK47
& totalorderedP(sK49)
& frontsegP(sK50,sK49)
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
! [X4,X5,X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
=> ( ~ leq(X4,sK51(X4,X5,X6))
& lt(X4,sK51(X4,X5,X6))
& memberP(X6,sK51(X4,X5,X6))
& memberP(X5,sK51(X4,X5,X6))
& ssItem(sK51(X4,X5,X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [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) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != X0
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [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) )
& ! [X8] :
( ~ totalorderedP(X8)
| ~ segmentP(X8,X2)
| ~ frontsegP(X3,X8)
| ~ neq(X2,X8)
| ~ ssList(X8) )
& nil != X0
& totalorderedP(X2)
& frontsegP(X3,X2)
& 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] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ? [X8] :
( totalorderedP(X8)
& segmentP(X8,X2)
& frontsegP(X3,X8)
& neq(X2,X8)
& ssList(X8) )
| nil = X0
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| nil = X0
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| nil = X0
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',co1) ).
fof(f536,plain,
nil != sK47,
inference(cnf_transformation,[],[f337]) ).
fof(f840,plain,
( ~ spl52_7
| spl52_23
| ~ spl52_18
| ~ spl52_19 ),
inference(avatar_split_clause,[],[f835,f696,f692,f837,f623]) ).
fof(f623,plain,
( spl52_7
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f692,plain,
( spl52_18
<=> ! [X0,X1] :
( ~ ssItem(X0)
| memberP(nil,sK51(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_18])]) ).
fof(f696,plain,
( spl52_19
<=> ! [X0,X1] :
( ~ ssItem(X0)
| ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_19])]) ).
fof(f835,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_18
| ~ spl52_19 ),
inference(equality_resolution,[],[f834]) ).
fof(f834,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(duplicate_literal_removal,[],[f833]) ).
fof(f833,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(resolution,[],[f832,f426]) ).
fof(f426,plain,
! [X0] :
( ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f308,plain,
! [X0] :
( ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0))
& ssList(sK43(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f125,f307,f306]) ).
fof(f306,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
& ssList(sK43(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f307,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
=> ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax20) ).
fof(f832,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(duplicate_literal_removal,[],[f831]) ).
fof(f831,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(resolution,[],[f829,f425]) ).
fof(f425,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f829,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(superposition,[],[f828,f427]) ).
fof(f427,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f828,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_18
| ~ spl52_19 ),
inference(duplicate_literal_removal,[],[f825]) ).
fof(f825,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_18
| ~ spl52_19 ),
inference(superposition,[],[f823,f509]) ).
fof(f509,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f199,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/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax81) ).
fof(f823,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK49
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssList(X0) )
| ~ spl52_18
| ~ spl52_19 ),
inference(duplicate_literal_removal,[],[f820]) ).
fof(f820,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssItem(X1)
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK49 )
| ~ spl52_18
| ~ spl52_19 ),
inference(resolution,[],[f819,f697]) ).
fof(f697,plain,
( ! [X0,X1] :
( ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl52_19 ),
inference(avatar_component_clause,[],[f696]) ).
fof(f819,plain,
( ! [X0,X1] :
( ~ ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl52_18 ),
inference(duplicate_literal_removal,[],[f803]) ).
fof(f803,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_18 ),
inference(superposition,[],[f702,f509]) ).
fof(f702,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1)) )
| ~ spl52_18 ),
inference(resolution,[],[f693,f451]) ).
fof(f451,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax38) ).
fof(f693,plain,
( ! [X0,X1] :
( memberP(nil,sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl52_18 ),
inference(avatar_component_clause,[],[f692]) ).
fof(f698,plain,
( ~ spl52_1
| spl52_19
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f674,f613,f696,f593]) ).
fof(f593,plain,
( spl52_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f613,plain,
( spl52_6
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f674,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(duplicate_literal_removal,[],[f673]) ).
fof(f673,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(resolution,[],[f420,f614]) ).
fof(f614,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f420,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,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/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax16) ).
fof(f694,plain,
( ~ spl52_1
| spl52_18
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f675,f597,f692,f593]) ).
fof(f597,plain,
( spl52_2
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f675,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(duplicate_literal_removal,[],[f672]) ).
fof(f672,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(resolution,[],[f420,f598]) ).
fof(f598,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f659,plain,
spl52_7,
inference(avatar_contradiction_clause,[],[f658]) ).
fof(f658,plain,
( $false
| spl52_7 ),
inference(resolution,[],[f625,f530]) ).
fof(f530,plain,
ssList(sK49),
inference(cnf_transformation,[],[f337]) ).
fof(f625,plain,
( ~ ssList(sK49)
| spl52_7 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f651,plain,
spl52_1,
inference(avatar_contradiction_clause,[],[f650]) ).
fof(f650,plain,
( $false
| spl52_1 ),
inference(resolution,[],[f595,f421]) ).
fof(f421,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax17) ).
fof(f595,plain,
( ~ ssList(nil)
| spl52_1 ),
inference(avatar_component_clause,[],[f593]) ).
fof(f615,plain,
( ~ spl52_1
| spl52_6 ),
inference(avatar_split_clause,[],[f591,f613,f593]) ).
fof(f591,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f547,f435]) ).
fof(f435,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.nOjvvyepeM/Vampire---4.8_16311',ax28) ).
fof(f547,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK49
| ssItem(sK51(X4,X5,X6))
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f538,f533]) ).
fof(f538,plain,
! [X6,X4,X5] :
( ssItem(sK51(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f337]) ).
fof(f599,plain,
( ~ spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f587,f597,f593]) ).
fof(f587,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| memberP(nil,sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f546,f435]) ).
fof(f546,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK49
| memberP(X5,sK51(X4,X5,X6))
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f539,f533]) ).
fof(f539,plain,
! [X6,X4,X5] :
( memberP(X5,sK51(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC247+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % 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.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:16:47 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.nOjvvyepeM/Vampire---4.8_16311
% 0.56/0.75 % (16572)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 (2996ds/83Mi)
% 0.56/0.76 % (16566)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 (2996ds/34Mi)
% 0.56/0.76 % (16568)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.76 % (16567)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 (2996ds/51Mi)
% 0.56/0.76 % (16569)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.76 % (16570)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 (2996ds/34Mi)
% 0.56/0.76 % (16571)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.77 % (16573)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 (2996ds/56Mi)
% 0.56/0.77 % (16567)First to succeed.
% 0.56/0.77 % (16571)Also succeeded, but the first one will report.
% 0.56/0.77 % (16569)Instruction limit reached!
% 0.56/0.77 % (16569)------------------------------
% 0.56/0.77 % (16569)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.77 % (16569)Termination reason: Unknown
% 0.56/0.77 % (16569)Termination phase: Saturation
% 0.56/0.77
% 0.56/0.77 % (16569)Memory used [KB]: 1751
% 0.56/0.77 % (16569)Time elapsed: 0.020 s
% 0.56/0.77 % (16569)Instructions burned: 34 (million)
% 0.56/0.77 % (16569)------------------------------
% 0.56/0.77 % (16569)------------------------------
% 0.56/0.77 % (16567)Refutation found. Thanks to Tanya!
% 0.56/0.77 % SZS status Theorem for Vampire---4
% 0.56/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.78 % (16567)------------------------------
% 0.56/0.78 % (16567)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.78 % (16567)Termination reason: Refutation
% 0.56/0.78
% 0.56/0.78 % (16567)Memory used [KB]: 1490
% 0.56/0.78 % (16567)Time elapsed: 0.019 s
% 0.56/0.78 % (16567)Instructions burned: 31 (million)
% 0.56/0.78 % (16567)------------------------------
% 0.56/0.78 % (16567)------------------------------
% 0.56/0.78 % (16562)Success in time 0.388 s
% 0.56/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------