TSTP Solution File: SWC330+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC330+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 : n026.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:12 EDT 2024
% Result : Theorem 0.55s 0.77s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of formulae : 99 ( 10 unt; 0 def)
% Number of atoms : 524 ( 114 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 651 ( 226 ~; 211 |; 174 &)
% ( 12 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 9 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 164 ( 101 !; 63 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f870,plain,
$false,
inference(avatar_sat_refutation,[],[f298,f307,f312,f333,f346,f487,f492,f808,f866,f869]) ).
fof(f869,plain,
( ~ spl20_3
| spl20_9 ),
inference(avatar_contradiction_clause,[],[f868]) ).
fof(f868,plain,
( $false
| ~ spl20_3
| spl20_9 ),
inference(subsumption_resolution,[],[f867,f302]) ).
fof(f302,plain,
( sP0(sK7,sK6)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f300]) ).
fof(f300,plain,
( spl20_3
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_3])]) ).
fof(f867,plain,
( ~ sP0(sK7,sK6)
| spl20_9 ),
inference(resolution,[],[f448,f197]) ).
fof(f197,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,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])],[f153,f156,f155,f154]) ).
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) )
=> ( ? [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(f155,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(f156,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(f153,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,[],[f152]) ).
fof(f152,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,[],[f150]) ).
fof(f150,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(f448,plain,
( ~ ssList(sK3(sK7,sK6))
| spl20_9 ),
inference(avatar_component_clause,[],[f446]) ).
fof(f446,plain,
( spl20_9
<=> ssList(sK3(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_9])]) ).
fof(f866,plain,
( ~ spl20_9
| spl20_1
| ~ spl20_3
| ~ spl20_14 ),
inference(avatar_split_clause,[],[f865,f764,f300,f291,f446]) ).
fof(f291,plain,
( spl20_1
<=> segmentP(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_1])]) ).
fof(f764,plain,
( spl20_14
<=> ssList(sK2(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_14])]) ).
fof(f865,plain,
( ~ ssList(sK3(sK7,sK6))
| spl20_1
| ~ spl20_3
| ~ spl20_14 ),
inference(subsumption_resolution,[],[f864,f293]) ).
fof(f293,plain,
( ~ segmentP(sK7,sK6)
| spl20_1 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f864,plain,
( ~ ssList(sK3(sK7,sK6))
| segmentP(sK7,sK6)
| ~ spl20_3
| ~ spl20_14 ),
inference(subsumption_resolution,[],[f863,f204]) ).
fof(f204,plain,
ssList(sK6),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f151,f161,f160,f159,f158]) ).
fof(f158,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(X1,sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(X1,sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X3] :
( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f150]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,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) ) )
& 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] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(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) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [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
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [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
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f863,plain,
( ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl20_3
| ~ spl20_14 ),
inference(subsumption_resolution,[],[f834,f765]) ).
fof(f765,plain,
( ssList(sK2(sK7,sK6))
| ~ spl20_14 ),
inference(avatar_component_clause,[],[f764]) ).
fof(f834,plain,
( ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl20_3 ),
inference(subsumption_resolution,[],[f823,f205]) ).
fof(f205,plain,
ssList(sK7),
inference(cnf_transformation,[],[f162]) ).
fof(f823,plain,
( ~ ssList(sK7)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl20_3 ),
inference(superposition,[],[f284,f628]) ).
fof(f628,plain,
( sK7 = app(app(sK2(sK7,sK6),sK6),sK3(sK7,sK6))
| ~ spl20_3 ),
inference(resolution,[],[f302,f199]) ).
fof(f199,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f284,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,[],[f255]) ).
fof(f255,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,[],[f185]) ).
fof(f185,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1))
& ssList(sK14(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f182,f184,f183]) ).
fof(f183,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f182,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,[],[f181]) ).
fof(f181,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,[],[f131]) ).
fof(f131,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(f808,plain,
( ~ spl20_3
| spl20_14 ),
inference(avatar_contradiction_clause,[],[f807]) ).
fof(f807,plain,
( $false
| ~ spl20_3
| spl20_14 ),
inference(subsumption_resolution,[],[f806,f302]) ).
fof(f806,plain,
( ~ sP0(sK7,sK6)
| spl20_14 ),
inference(resolution,[],[f766,f196]) ).
fof(f196,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f766,plain,
( ~ ssList(sK2(sK7,sK6))
| spl20_14 ),
inference(avatar_component_clause,[],[f764]) ).
fof(f492,plain,
( spl20_2
| ~ spl20_4 ),
inference(avatar_contradiction_clause,[],[f491]) ).
fof(f491,plain,
( $false
| spl20_2
| ~ spl20_4 ),
inference(subsumption_resolution,[],[f490,f264]) ).
fof(f264,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f490,plain,
( ~ equalelemsP(nil)
| spl20_2
| ~ spl20_4 ),
inference(forward_demodulation,[],[f297,f306]) ).
fof(f306,plain,
( nil = sK6
| ~ spl20_4 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f304,plain,
( spl20_4
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl20_4])]) ).
fof(f297,plain,
( ~ equalelemsP(sK6)
| spl20_2 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f295,plain,
( spl20_2
<=> equalelemsP(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_2])]) ).
fof(f487,plain,
( spl20_1
| ~ spl20_4
| ~ spl20_5 ),
inference(avatar_contradiction_clause,[],[f486]) ).
fof(f486,plain,
( $false
| spl20_1
| ~ spl20_4
| ~ spl20_5 ),
inference(subsumption_resolution,[],[f481,f313]) ).
fof(f313,plain,
segmentP(nil,nil),
inference(subsumption_resolution,[],[f283,f233]) ).
fof(f233,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f283,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f246]) ).
fof(f246,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f481,plain,
( ~ segmentP(nil,nil)
| spl20_1
| ~ spl20_4
| ~ spl20_5 ),
inference(backward_demodulation,[],[f474,f306]) ).
fof(f474,plain,
( ~ segmentP(nil,sK6)
| spl20_1
| ~ spl20_5 ),
inference(backward_demodulation,[],[f293,f311]) ).
fof(f311,plain,
( nil = sK7
| ~ spl20_5 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f309,plain,
( spl20_5
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl20_5])]) ).
fof(f346,plain,
( ~ spl20_3
| spl20_6 ),
inference(avatar_contradiction_clause,[],[f345]) ).
fof(f345,plain,
( $false
| ~ spl20_3
| spl20_6 ),
inference(subsumption_resolution,[],[f344,f302]) ).
fof(f344,plain,
( ~ sP0(sK7,sK6)
| spl20_6 ),
inference(resolution,[],[f332,f195]) ).
fof(f195,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f332,plain,
( ~ ssItem(sK1(sK7,sK6))
| spl20_6 ),
inference(avatar_component_clause,[],[f330]) ).
fof(f330,plain,
( spl20_6
<=> ssItem(sK1(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_6])]) ).
fof(f333,plain,
( ~ spl20_6
| spl20_2
| ~ spl20_3 ),
inference(avatar_split_clause,[],[f324,f300,f295,f330]) ).
fof(f324,plain,
( equalelemsP(sK6)
| ~ ssItem(sK1(sK7,sK6))
| ~ spl20_3 ),
inference(superposition,[],[f265,f323]) ).
fof(f323,plain,
( sK6 = cons(sK1(sK7,sK6),nil)
| ~ spl20_3 ),
inference(resolution,[],[f198,f302]) ).
fof(f198,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f157]) ).
fof(f265,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,axiom,
! [X0] :
( ssItem(X0)
=> equalelemsP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax73) ).
fof(f312,plain,
( spl20_3
| spl20_5 ),
inference(avatar_split_clause,[],[f208,f309,f300]) ).
fof(f208,plain,
( nil = sK7
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f162]) ).
fof(f307,plain,
( spl20_3
| spl20_4 ),
inference(avatar_split_clause,[],[f209,f304,f300]) ).
fof(f209,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f162]) ).
fof(f298,plain,
( ~ spl20_1
| ~ spl20_2 ),
inference(avatar_split_clause,[],[f276,f295,f291]) ).
fof(f276,plain,
( ~ equalelemsP(sK6)
| ~ segmentP(sK7,sK6) ),
inference(definition_unfolding,[],[f210,f207,f206,f207]) ).
fof(f206,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f162]) ).
fof(f207,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f162]) ).
fof(f210,plain,
( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) ),
inference(cnf_transformation,[],[f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC330+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.11 % 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.31 % Computer : n026.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 : Sun May 19 03:05:23 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.55/0.74 % (27034)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.55/0.74 % (27038)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.55/0.74 % (27037)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.55/0.74 % (27039)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.55/0.74 % (27041)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.55/0.74 % (27040)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.55/0.74 % (27035)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.55/0.75 % (27036)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.55/0.75 % (27038)Instruction limit reached!
% 0.55/0.75 % (27038)------------------------------
% 0.55/0.75 % (27038)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (27038)Termination reason: Unknown
% 0.55/0.75 % (27038)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (27038)Memory used [KB]: 1702
% 0.55/0.75 % (27038)Time elapsed: 0.010 s
% 0.55/0.75 % (27038)Instructions burned: 36 (million)
% 0.55/0.75 % (27038)------------------------------
% 0.55/0.75 % (27038)------------------------------
% 0.55/0.75 % (27037)Instruction limit reached!
% 0.55/0.75 % (27037)------------------------------
% 0.55/0.75 % (27037)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (27037)Termination reason: Unknown
% 0.55/0.75 % (27037)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (27037)Memory used [KB]: 1594
% 0.55/0.75 % (27037)Time elapsed: 0.011 s
% 0.55/0.75 % (27037)Instructions burned: 35 (million)
% 0.55/0.75 % (27037)------------------------------
% 0.55/0.75 % (27037)------------------------------
% 0.55/0.75 % (27043)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.55/0.75 % (27042)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.55/0.76 % (27034)Instruction limit reached!
% 0.55/0.76 % (27034)------------------------------
% 0.55/0.76 % (27034)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (27034)Termination reason: Unknown
% 0.55/0.76 % (27034)Termination phase: Saturation
% 0.55/0.76
% 0.55/0.76 % (27034)Memory used [KB]: 1528
% 0.55/0.76 % (27034)Time elapsed: 0.019 s
% 0.55/0.76 % (27034)Instructions burned: 35 (million)
% 0.55/0.76 % (27034)------------------------------
% 0.55/0.76 % (27034)------------------------------
% 0.55/0.76 % (27039)Instruction limit reached!
% 0.55/0.76 % (27039)------------------------------
% 0.55/0.76 % (27039)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (27039)Termination reason: Unknown
% 0.55/0.76 % (27039)Termination phase: Saturation
% 0.55/0.76
% 0.55/0.76 % (27039)Memory used [KB]: 1445
% 0.55/0.76 % (27039)Time elapsed: 0.019 s
% 0.55/0.76 % (27039)Instructions burned: 46 (million)
% 0.55/0.76 % (27039)------------------------------
% 0.55/0.76 % (27039)------------------------------
% 0.55/0.76 % (27044)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.55/0.76 % (27041)Instruction limit reached!
% 0.55/0.76 % (27041)------------------------------
% 0.55/0.76 % (27041)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (27041)Termination reason: Unknown
% 0.55/0.76 % (27041)Termination phase: Saturation
% 0.55/0.76
% 0.55/0.76 % (27041)Memory used [KB]: 1673
% 0.55/0.76 % (27041)Time elapsed: 0.026 s
% 0.55/0.76 % (27041)Instructions burned: 56 (million)
% 0.55/0.76 % (27041)------------------------------
% 0.55/0.76 % (27041)------------------------------
% 0.55/0.76 % (27036)First to succeed.
% 0.55/0.77 % (27043)Instruction limit reached!
% 0.55/0.77 % (27043)------------------------------
% 0.55/0.77 % (27043)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77 % (27043)Termination reason: Unknown
% 0.55/0.77 % (27043)Termination phase: Saturation
% 0.55/0.77
% 0.55/0.77 % (27043)Memory used [KB]: 1931
% 0.55/0.77 % (27043)Time elapsed: 0.015 s
% 0.55/0.77 % (27043)Instructions burned: 53 (million)
% 0.55/0.77 % (27043)------------------------------
% 0.55/0.77 % (27043)------------------------------
% 0.55/0.77 % (27036)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27033"
% 0.55/0.77 % (27036)Refutation found. Thanks to Tanya!
% 0.55/0.77 % SZS status Theorem for theBenchmark
% 0.55/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.77 % (27036)------------------------------
% 0.55/0.77 % (27036)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77 % (27036)Termination reason: Refutation
% 0.55/0.77
% 0.55/0.77 % (27036)Memory used [KB]: 1432
% 0.55/0.77 % (27036)Time elapsed: 0.022 s
% 0.55/0.77 % (27036)Instructions burned: 37 (million)
% 0.55/0.77 % (27033)Success in time 0.443 s
% 0.55/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------