TSTP Solution File: SWC384+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC384+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:38:36 EDT 2024
% Result : Theorem 0.62s 0.80s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 23
% Syntax : Number of formulae : 102 ( 10 unt; 0 def)
% Number of atoms : 593 ( 128 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 750 ( 259 ~; 232 |; 210 &)
% ( 13 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 193 ( 118 !; 75 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f845,plain,
$false,
inference(avatar_sat_refutation,[],[f303,f317,f357,f367,f561,f582,f815,f842]) ).
fof(f842,plain,
( spl17_2
| ~ spl17_3
| ~ spl17_11
| ~ spl17_15 ),
inference(avatar_contradiction_clause,[],[f841]) ).
fof(f841,plain,
( $false
| spl17_2
| ~ spl17_3
| ~ spl17_11
| ~ spl17_15 ),
inference(subsumption_resolution,[],[f840,f302]) ).
fof(f302,plain,
( ~ segmentP(sK7,sK6)
| spl17_2 ),
inference(avatar_component_clause,[],[f300]) ).
fof(f300,plain,
( spl17_2
<=> segmentP(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f840,plain,
( segmentP(sK7,sK6)
| ~ spl17_3
| ~ spl17_11
| ~ spl17_15 ),
inference(subsumption_resolution,[],[f839,f204]) ).
fof(f204,plain,
ssList(sK6),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& neq(sK5,nil)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f152,f162,f161,f160,f159]) ).
fof(f159,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK4)
| ~ singletonP(sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(X1,nil)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK4)
| ~ singletonP(sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(X1,nil)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(sK5,nil)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(sK5,nil)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& neq(sK5,nil)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X3] :
( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& neq(sK5,nil)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& neq(sK5,nil)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f151]) ).
fof(f151,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& neq(X1,nil)
& 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)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != 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)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f839,plain,
( ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl17_3
| ~ spl17_11
| ~ spl17_15 ),
inference(subsumption_resolution,[],[f838,f776]) ).
fof(f776,plain,
( ssList(sK2(sK7,sK6))
| ~ spl17_15 ),
inference(avatar_component_clause,[],[f775]) ).
fof(f775,plain,
( spl17_15
<=> ssList(sK2(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_15])]) ).
fof(f838,plain,
( ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl17_3
| ~ spl17_11 ),
inference(subsumption_resolution,[],[f837,f477]) ).
fof(f477,plain,
( ssList(sK3(sK7,sK6))
| ~ spl17_11 ),
inference(avatar_component_clause,[],[f476]) ).
fof(f476,plain,
( spl17_11
<=> ssList(sK3(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_11])]) ).
fof(f837,plain,
( ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl17_3 ),
inference(subsumption_resolution,[],[f823,f205]) ).
fof(f205,plain,
ssList(sK7),
inference(cnf_transformation,[],[f163]) ).
fof(f823,plain,
( ~ ssList(sK7)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl17_3 ),
inference(superposition,[],[f288,f565]) ).
fof(f565,plain,
( sK7 = app(app(sK2(sK7,sK6),sK6),sK3(sK7,sK6))
| ~ spl17_3 ),
inference(resolution,[],[f307,f199]) ).
fof(f199,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f154,f157,f156,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f151]) ).
fof(f307,plain,
( sP0(sK7,sK6)
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f305,plain,
( spl17_3
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_3])]) ).
fof(f288,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f264]) ).
fof(f264,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f192]) ).
fof(f192,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK15(X0,X1),X1),sK16(X0,X1)) = X0
& ssList(sK16(X0,X1))
& ssList(sK15(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16])],[f189,f191,f190]) ).
fof(f190,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK15(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK15(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f191,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK15(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK15(X0,X1),X1),sK16(X0,X1)) = X0
& ssList(sK16(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f189,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f188]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f815,plain,
( ~ spl17_3
| spl17_15 ),
inference(avatar_contradiction_clause,[],[f814]) ).
fof(f814,plain,
( $false
| ~ spl17_3
| spl17_15 ),
inference(subsumption_resolution,[],[f813,f307]) ).
fof(f813,plain,
( ~ sP0(sK7,sK6)
| spl17_15 ),
inference(resolution,[],[f777,f196]) ).
fof(f196,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f777,plain,
( ~ ssList(sK2(sK7,sK6))
| spl17_15 ),
inference(avatar_component_clause,[],[f775]) ).
fof(f582,plain,
( ~ spl17_3
| spl17_11 ),
inference(avatar_contradiction_clause,[],[f581]) ).
fof(f581,plain,
( $false
| ~ spl17_3
| spl17_11 ),
inference(subsumption_resolution,[],[f580,f307]) ).
fof(f580,plain,
( ~ sP0(sK7,sK6)
| spl17_11 ),
inference(resolution,[],[f478,f197]) ).
fof(f197,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f478,plain,
( ~ ssList(sK3(sK7,sK6))
| spl17_11 ),
inference(avatar_component_clause,[],[f476]) ).
fof(f561,plain,
~ spl17_5,
inference(avatar_contradiction_clause,[],[f560]) ).
fof(f560,plain,
( $false
| ~ spl17_5 ),
inference(subsumption_resolution,[],[f558,f238]) ).
fof(f238,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f558,plain,
( ~ ssList(nil)
| ~ spl17_5 ),
inference(resolution,[],[f522,f293]) ).
fof(f293,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f282]) ).
fof(f282,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f234]) ).
fof(f234,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,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/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f522,plain,
( neq(nil,nil)
| ~ spl17_5 ),
inference(backward_demodulation,[],[f277,f316]) ).
fof(f316,plain,
( nil = sK7
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f314,plain,
( spl17_5
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).
fof(f277,plain,
neq(sK7,nil),
inference(definition_unfolding,[],[f208,f206]) ).
fof(f206,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f163]) ).
fof(f208,plain,
neq(sK5,nil),
inference(cnf_transformation,[],[f163]) ).
fof(f367,plain,
( spl17_1
| ~ spl17_3
| ~ spl17_6 ),
inference(avatar_split_clause,[],[f366,f339,f305,f296]) ).
fof(f296,plain,
( spl17_1
<=> singletonP(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_1])]) ).
fof(f339,plain,
( spl17_6
<=> ssItem(sK1(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).
fof(f366,plain,
( singletonP(sK6)
| ~ spl17_3
| ~ spl17_6 ),
inference(subsumption_resolution,[],[f365,f204]) ).
fof(f365,plain,
( singletonP(sK6)
| ~ ssList(sK6)
| ~ spl17_3
| ~ spl17_6 ),
inference(subsumption_resolution,[],[f359,f340]) ).
fof(f340,plain,
( ssItem(sK1(sK7,sK6))
| ~ spl17_6 ),
inference(avatar_component_clause,[],[f339]) ).
fof(f359,plain,
( singletonP(sK6)
| ~ ssItem(sK1(sK7,sK6))
| ~ ssList(sK6)
| ~ spl17_3 ),
inference(superposition,[],[f286,f328]) ).
fof(f328,plain,
( sK6 = cons(sK1(sK7,sK6),nil)
| ~ spl17_3 ),
inference(resolution,[],[f198,f307]) ).
fof(f198,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f158]) ).
fof(f286,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f253]) ).
fof(f253,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f186]) ).
fof(f186,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK14(X0),nil) = X0
& ssItem(sK14(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f184,f185]) ).
fof(f185,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK14(X0),nil) = X0
& ssItem(sK14(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f183]) ).
fof(f183,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f357,plain,
( ~ spl17_3
| spl17_6 ),
inference(avatar_contradiction_clause,[],[f356]) ).
fof(f356,plain,
( $false
| ~ spl17_3
| spl17_6 ),
inference(subsumption_resolution,[],[f355,f307]) ).
fof(f355,plain,
( ~ sP0(sK7,sK6)
| spl17_6 ),
inference(resolution,[],[f341,f195]) ).
fof(f195,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f341,plain,
( ~ ssItem(sK1(sK7,sK6))
| spl17_6 ),
inference(avatar_component_clause,[],[f339]) ).
fof(f317,plain,
( spl17_3
| spl17_5 ),
inference(avatar_split_clause,[],[f209,f314,f305]) ).
fof(f209,plain,
( nil = sK7
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f163]) ).
fof(f303,plain,
( ~ spl17_1
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f276,f300,f296]) ).
fof(f276,plain,
( ~ segmentP(sK7,sK6)
| ~ singletonP(sK6) ),
inference(definition_unfolding,[],[f211,f206,f207,f207]) ).
fof(f207,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f163]) ).
fof(f211,plain,
( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) ),
inference(cnf_transformation,[],[f163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWC384+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.10 % 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.10/0.29 % Computer : n028.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 03:35:52 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.30 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/benchmark/theBenchmark.p
% 0.62/0.78 % (25627)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.78 % (25625)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.62/0.78 % (25628)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.62/0.78 % (25626)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.62/0.78 % (25629)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.62/0.78 % (25630)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.62/0.78 % (25632)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.62/0.78 % (25631)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.62/0.78 % (25630)Refutation not found, incomplete strategy% (25630)------------------------------
% 0.62/0.78 % (25630)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.78 % (25630)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.78
% 0.62/0.78 % (25630)Memory used [KB]: 1149
% 0.62/0.78 % (25630)Time elapsed: 0.005 s
% 0.62/0.78 % (25630)Instructions burned: 6 (million)
% 0.62/0.78 % (25630)------------------------------
% 0.62/0.78 % (25630)------------------------------
% 0.62/0.79 % (25633)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.62/0.79 % (25629)Instruction limit reached!
% 0.62/0.79 % (25629)------------------------------
% 0.62/0.79 % (25629)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.79 % (25629)Termination reason: Unknown
% 0.62/0.79 % (25629)Termination phase: Saturation
% 0.62/0.79
% 0.62/0.79 % (25629)Memory used [KB]: 2028
% 0.62/0.79 % (25629)Time elapsed: 0.018 s
% 0.62/0.79 % (25629)Instructions burned: 34 (million)
% 0.62/0.79 % (25629)------------------------------
% 0.62/0.79 % (25629)------------------------------
% 0.62/0.79 % (25627)First to succeed.
% 0.62/0.79 % (25625)Instruction limit reached!
% 0.62/0.79 % (25625)------------------------------
% 0.62/0.79 % (25625)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.79 % (25625)Termination reason: Unknown
% 0.62/0.79 % (25625)Termination phase: Saturation
% 0.62/0.79
% 0.62/0.79 % (25625)Memory used [KB]: 1537
% 0.62/0.79 % (25625)Time elapsed: 0.020 s
% 0.62/0.79 % (25625)Instructions burned: 34 (million)
% 0.62/0.79 % (25625)------------------------------
% 0.62/0.79 % (25625)------------------------------
% 0.62/0.80 % (25628)Instruction limit reached!
% 0.62/0.80 % (25628)------------------------------
% 0.62/0.80 % (25628)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (25628)Termination reason: Unknown
% 0.62/0.80 % (25628)Termination phase: Saturation
% 0.62/0.80
% 0.62/0.80 % (25628)Memory used [KB]: 1741
% 0.62/0.80 % (25628)Time elapsed: 0.019 s
% 0.62/0.80 % (25628)Instructions burned: 33 (million)
% 0.62/0.80 % (25628)------------------------------
% 0.62/0.80 % (25628)------------------------------
% 0.62/0.80 % (25634)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.62/0.80 % (25627)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25624"
% 0.62/0.80 % (25627)Refutation found. Thanks to Tanya!
% 0.62/0.80 % SZS status Theorem for theBenchmark
% 0.62/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.80 % (25627)------------------------------
% 0.62/0.80 % (25627)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (25627)Termination reason: Refutation
% 0.62/0.80
% 0.62/0.80 % (25627)Memory used [KB]: 1420
% 0.62/0.80 % (25627)Time elapsed: 0.021 s
% 0.62/0.80 % (25627)Instructions burned: 36 (million)
% 0.62/0.80 % (25624)Success in time 0.491 s
% 0.62/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------