TSTP Solution File: SWC106+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC106+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 : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:36:15 EDT 2024
% Result : Theorem 0.51s 0.73s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 90 ( 8 unt; 0 def)
% Number of atoms : 393 ( 83 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 448 ( 145 ~; 138 |; 127 &)
% ( 11 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 149 ( 102 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f491,plain,
$false,
inference(avatar_sat_refutation,[],[f229,f231,f265,f281,f292,f394,f429,f490]) ).
fof(f490,plain,
( spl12_4
| spl12_6 ),
inference(avatar_contradiction_clause,[],[f489]) ).
fof(f489,plain,
( $false
| spl12_4
| spl12_6 ),
inference(subsumption_resolution,[],[f488,f165]) ).
fof(f165,plain,
ssList(sK5),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,sK6,sK5) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f131,f140,f139,f138,f137]) ).
fof(f137,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X1,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK3,X1,X3,X2) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK3,X1,X3,X2) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,X3,X2) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,X3,X2) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,X3,sK5) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,X3,sK5) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK3,sK4,sK6,sK5) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X1,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f130]) ).
fof(f130,plain,
! [X0,X1,X3,X2] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP0(X0,X1,X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f488,plain,
( ~ ssList(sK5)
| spl12_4
| spl12_6 ),
inference(subsumption_resolution,[],[f487,f197]) ).
fof(f197,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f487,plain,
( ~ ssList(nil)
| ~ ssList(sK5)
| spl12_4
| spl12_6 ),
inference(subsumption_resolution,[],[f476,f278]) ).
fof(f278,plain,
( nil != sK5
| spl12_6 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f276,plain,
( spl12_6
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f476,plain,
( nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5)
| spl12_4 ),
inference(resolution,[],[f264,f194]) ).
fof(f194,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f264,plain,
( ~ neq(sK5,nil)
| spl12_4 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl12_4
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f429,plain,
( ~ spl12_1
| spl12_7 ),
inference(avatar_contradiction_clause,[],[f428]) ).
fof(f428,plain,
( $false
| ~ spl12_1
| spl12_7 ),
inference(resolution,[],[f411,f224]) ).
fof(f224,plain,
( sP0(sK5,sK6,sK6,sK5)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl12_1
<=> sP0(sK5,sK6,sK6,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f411,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK6,sK5)
| spl12_7 ),
inference(resolution,[],[f374,f159]) ).
fof(f159,plain,
! [X2,X3,X0,X1] :
( ssList(sK2(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0,X1,X2,X3] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& app(sK2(X2,X3),cons(sK1(X2,X3),nil)) = X2
& cons(sK1(X2,X3),nil) = X3
& ssList(sK2(X2,X3))
& ssItem(sK1(X2,X3))
& neq(X1,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f133,f135,f134]) ).
fof(f134,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& cons(X4,nil) = X3
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK1(X2,X3),nil)) = X2
& cons(sK1(X2,X3),nil) = X3
& ssList(X5) )
& ssItem(sK1(X2,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X2,X3] :
( ? [X5] :
( app(X5,cons(sK1(X2,X3),nil)) = X2
& cons(sK1(X2,X3),nil) = X3
& ssList(X5) )
=> ( app(sK2(X2,X3),cons(sK1(X2,X3),nil)) = X2
& cons(sK1(X2,X3),nil) = X3
& ssList(sK2(X2,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& cons(X4,nil) = X3
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f132]) ).
fof(f132,plain,
! [X0,X1,X3,X2] :
( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP0(X0,X1,X3,X2) ),
inference(nnf_transformation,[],[f130]) ).
fof(f374,plain,
( ~ ssList(sK2(sK6,sK5))
| spl12_7 ),
inference(avatar_component_clause,[],[f372]) ).
fof(f372,plain,
( spl12_7
<=> ssList(sK2(sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f394,plain,
( ~ spl12_7
| ~ spl12_1
| spl12_3 ),
inference(avatar_split_clause,[],[f393,f258,f222,f372]) ).
fof(f258,plain,
( spl12_3
<=> rearsegP(sK6,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f393,plain,
( ~ ssList(sK2(sK6,sK5))
| ~ spl12_1
| spl12_3 ),
inference(subsumption_resolution,[],[f392,f165]) ).
fof(f392,plain,
( ~ ssList(sK2(sK6,sK5))
| ~ ssList(sK5)
| ~ spl12_1
| spl12_3 ),
inference(subsumption_resolution,[],[f368,f260]) ).
fof(f260,plain,
( ~ rearsegP(sK6,sK5)
| spl12_3 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f368,plain,
( rearsegP(sK6,sK5)
| ~ ssList(sK2(sK6,sK5))
| ~ ssList(sK5)
| ~ spl12_1 ),
inference(superposition,[],[f233,f364]) ).
fof(f364,plain,
( sK6 = app(sK2(sK6,sK5),sK5)
| ~ spl12_1 ),
inference(forward_demodulation,[],[f363,f266]) ).
fof(f266,plain,
( sK5 = cons(sK1(sK6,sK5),nil)
| ~ spl12_1 ),
inference(resolution,[],[f160,f224]) ).
fof(f160,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X2,X3),nil) = X3 ),
inference(cnf_transformation,[],[f136]) ).
fof(f363,plain,
( sK6 = app(sK2(sK6,sK5),cons(sK1(sK6,sK5),nil))
| ~ spl12_1 ),
inference(resolution,[],[f161,f224]) ).
fof(f161,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X2,X3),cons(sK1(X2,X3),nil)) = X2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f233,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f217,f192]) ).
fof(f192,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(f217,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f207]) ).
fof(f207,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK11(X0,X1),X1) = X0
& ssList(sK11(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f154,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK11(X0,X1),X1) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(f292,plain,
( ~ spl12_1
| spl12_5 ),
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl12_1
| spl12_5 ),
inference(resolution,[],[f287,f224]) ).
fof(f287,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK6,sK5)
| spl12_5 ),
inference(resolution,[],[f274,f158]) ).
fof(f158,plain,
! [X2,X3,X0,X1] :
( ssItem(sK1(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f136]) ).
fof(f274,plain,
( ~ ssItem(sK1(sK6,sK5))
| spl12_5 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f272,plain,
( spl12_5
<=> ssItem(sK1(sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f281,plain,
( ~ spl12_5
| ~ spl12_6
| ~ spl12_1 ),
inference(avatar_split_clause,[],[f280,f222,f276,f272]) ).
fof(f280,plain,
( nil != sK5
| ~ ssItem(sK1(sK6,sK5))
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f268,f197]) ).
fof(f268,plain,
( nil != sK5
| ~ ssItem(sK1(sK6,sK5))
| ~ ssList(nil)
| ~ spl12_1 ),
inference(superposition,[],[f174,f266]) ).
fof(f174,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f265,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_1 ),
inference(avatar_split_clause,[],[f256,f222,f262,f258]) ).
fof(f256,plain,
( ~ neq(sK5,nil)
| ~ rearsegP(sK6,sK5)
| ~ spl12_1 ),
inference(resolution,[],[f162,f224]) ).
fof(f162,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f231,plain,
spl12_2,
inference(avatar_split_clause,[],[f230,f226]) ).
fof(f226,plain,
( spl12_2
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f230,plain,
neq(sK6,nil),
inference(subsumption_resolution,[],[f209,f157]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X1,nil) ),
inference(cnf_transformation,[],[f136]) ).
fof(f209,plain,
( neq(sK6,nil)
| sP0(sK5,sK6,sK6,sK5) ),
inference(definition_unfolding,[],[f169,f167,f168,f167]) ).
fof(f168,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f141]) ).
fof(f167,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f141]) ).
fof(f169,plain,
( neq(sK4,nil)
| sP0(sK3,sK4,sK6,sK5) ),
inference(cnf_transformation,[],[f141]) ).
fof(f229,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f208,f226,f222]) ).
fof(f208,plain,
( ~ neq(sK6,nil)
| sP0(sK5,sK6,sK6,sK5) ),
inference(definition_unfolding,[],[f170,f168,f167]) ).
fof(f170,plain,
( ~ neq(sK6,nil)
| sP0(sK3,sK4,sK6,sK5) ),
inference(cnf_transformation,[],[f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC106+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % 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.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 02:50:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 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.51/0.72 % (9545)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 (2996ds/56Mi)
% 0.51/0.72 % (9538)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 (2996ds/34Mi)
% 0.51/0.72 % (9540)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.72 % (9539)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 (2996ds/51Mi)
% 0.51/0.72 % (9542)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 (2996ds/34Mi)
% 0.51/0.72 % (9541)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.51/0.72 % (9543)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.51/0.72 % (9544)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 (2996ds/83Mi)
% 0.51/0.73 % (9540)First to succeed.
% 0.51/0.73 % (9540)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9537"
% 0.51/0.73 % (9540)Refutation found. Thanks to Tanya!
% 0.51/0.73 % SZS status Theorem for theBenchmark
% 0.51/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.73 % (9540)------------------------------
% 0.51/0.73 % (9540)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73 % (9540)Termination reason: Refutation
% 0.51/0.73
% 0.51/0.73 % (9540)Memory used [KB]: 1290
% 0.51/0.73 % (9540)Time elapsed: 0.013 s
% 0.51/0.73 % (9540)Instructions burned: 18 (million)
% 0.51/0.73 % (9537)Success in time 0.374 s
% 0.51/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------