TSTP Solution File: SWC356+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC356+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:38:24 EDT 2024
% Result : Theorem 0.52s 0.71s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 23
% Syntax : Number of formulae : 111 ( 9 unt; 0 def)
% Number of atoms : 640 ( 128 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 872 ( 343 ~; 313 |; 173 &)
% ( 9 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 201 ( 140 !; 61 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f498,plain,
$false,
inference(avatar_sat_refutation,[],[f266,f276,f282,f283,f284,f308,f314,f494]) ).
fof(f494,plain,
( ~ spl13_3
| ~ spl13_4
| ~ spl13_5 ),
inference(avatar_contradiction_clause,[],[f493]) ).
fof(f493,plain,
( $false
| ~ spl13_3
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f492,f265]) ).
fof(f265,plain,
( memberP(sK3,sK4)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f263,plain,
( spl13_3
<=> memberP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
fof(f492,plain,
( ~ memberP(sK3,sK4)
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f491,f173]) ).
fof(f173,plain,
ssList(sK3),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(X5,sK4)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f143,f142,f141,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(X1,X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(X1,sK0)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(X1,sK0)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ segmentP(sK1,sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(X5,sK4)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(X1,X0)
& 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] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ segmentP(X1,X0)
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| segmentP(X1,X0)
| ~ 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| segmentP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f491,plain,
( ~ ssList(sK3)
| ~ memberP(sK3,sK4)
| ~ spl13_4
| ~ spl13_5 ),
inference(duplicate_literal_removal,[],[f487]) ).
fof(f487,plain,
( ~ ssList(sK3)
| ~ memberP(sK3,sK4)
| ~ ssList(sK3)
| ~ spl13_4
| ~ spl13_5 ),
inference(resolution,[],[f486,f217]) ).
fof(f217,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f486,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f485,f275]) ).
fof(f275,plain,
( ssItem(sK4)
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f273,plain,
( spl13_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_5])]) ).
fof(f485,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(duplicate_literal_removal,[],[f484]) ).
fof(f484,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5 ),
inference(resolution,[],[f483,f209]) ).
fof(f209,plain,
! [X0,X1] :
( ssList(sK9(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f158,f160,f159]) ).
fof(f159,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(sK9(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X5] :
( app(sK9(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
=> ( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f483,plain,
( ! [X0] :
( ~ ssList(sK9(X0,sK4))
| ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f482,f275]) ).
fof(f482,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(duplicate_literal_removal,[],[f481]) ).
fof(f481,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5 ),
inference(resolution,[],[f480,f210]) ).
fof(f210,plain,
! [X0,X1] :
( ssList(sK10(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f480,plain,
( ! [X0] :
( ~ ssList(sK10(X0,sK4))
| ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f472,f275]) ).
fof(f472,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK10(X0,sK4))
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5 ),
inference(duplicate_literal_removal,[],[f471]) ).
fof(f471,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK10(X0,sK4))
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5 ),
inference(superposition,[],[f464,f211]) ).
fof(f211,plain,
! [X0,X1] :
( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f464,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f461,f275]) ).
fof(f461,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK4) )
| ~ spl13_4 ),
inference(duplicate_literal_removal,[],[f456]) ).
fof(f456,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(superposition,[],[f374,f232]) ).
fof(f232,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,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/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f374,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f367,f318]) ).
fof(f318,plain,
( ssList(cons(sK4,nil))
| ~ spl13_4 ),
inference(superposition,[],[f172,f270]) ).
fof(f270,plain,
( sK2 = cons(sK4,nil)
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f268,plain,
( spl13_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
fof(f172,plain,
ssList(sK2),
inference(cnf_transformation,[],[f144]) ).
fof(f367,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil)) )
| ~ spl13_4 ),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f364,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK4,nil))
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(superposition,[],[f328,f231]) ).
fof(f231,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f328,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f324,f318]) ).
fof(f324,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil)) )
| ~ spl13_4 ),
inference(duplicate_literal_removal,[],[f322]) ).
fof(f322,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1)) )
| ~ spl13_4 ),
inference(resolution,[],[f315,f247]) ).
fof(f247,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f223]) ).
fof(f223,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,[],[f167]) ).
fof(f167,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0
& ssList(sK12(X0,X1))
& ssList(sK11(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f164,f166,f165]) ).
fof(f165,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK11(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK11(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f164,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,[],[f163]) ).
fof(f163,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,[],[f122]) ).
fof(f122,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/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f315,plain,
( ! [X0] :
( ~ segmentP(X0,cons(sK4,nil))
| ~ segmentP(sK3,X0)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(forward_demodulation,[],[f287,f270]) ).
fof(f287,plain,
! [X0] :
( ~ segmentP(X0,sK2)
| ~ segmentP(sK3,X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f286,f173]) ).
fof(f286,plain,
! [X0] :
( ~ segmentP(X0,sK2)
| ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f285,f172]) ).
fof(f285,plain,
! [X0] :
( ~ segmentP(X0,sK2)
| ~ segmentP(sK3,X0)
| ~ ssList(sK2)
| ~ ssList(X0)
| ~ ssList(sK3) ),
inference(resolution,[],[f238,f219]) ).
fof(f219,plain,
! [X2,X0,X1] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X0,X1) )
=> segmentP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax53) ).
fof(f238,plain,
~ segmentP(sK3,sK2),
inference(definition_unfolding,[],[f177,f174,f175]) ).
fof(f175,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f174,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f144]) ).
fof(f177,plain,
~ segmentP(sK1,sK0),
inference(cnf_transformation,[],[f144]) ).
fof(f314,plain,
( ~ spl13_3
| ~ spl13_5
| ~ spl13_6 ),
inference(avatar_contradiction_clause,[],[f313]) ).
fof(f313,plain,
( $false
| ~ spl13_3
| ~ spl13_5
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f312,f275]) ).
fof(f312,plain,
( ~ ssItem(sK4)
| ~ spl13_3
| ~ spl13_6 ),
inference(resolution,[],[f310,f202]) ).
fof(f202,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f310,plain,
( memberP(nil,sK4)
| ~ spl13_3
| ~ spl13_6 ),
inference(forward_demodulation,[],[f265,f280]) ).
fof(f280,plain,
( nil = sK3
| ~ spl13_6 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f278,plain,
( spl13_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_6])]) ).
fof(f308,plain,
( ~ spl13_2
| ~ spl13_6 ),
inference(avatar_contradiction_clause,[],[f307]) ).
fof(f307,plain,
( $false
| ~ spl13_2
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f300,f201]) ).
fof(f201,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f300,plain,
( ~ ssList(nil)
| ~ spl13_2
| ~ spl13_6 ),
inference(resolution,[],[f293,f217]) ).
fof(f293,plain,
( ~ segmentP(nil,nil)
| ~ spl13_2
| ~ spl13_6 ),
inference(forward_demodulation,[],[f291,f280]) ).
fof(f291,plain,
( ~ segmentP(sK3,nil)
| ~ spl13_2 ),
inference(superposition,[],[f238,f260]) ).
fof(f260,plain,
( nil = sK2
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f258,plain,
( spl13_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
fof(f284,plain,
( spl13_5
| spl13_6 ),
inference(avatar_split_clause,[],[f178,f278,f273]) ).
fof(f178,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f283,plain,
( spl13_4
| spl13_6 ),
inference(avatar_split_clause,[],[f179,f278,f268]) ).
fof(f179,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f282,plain,
( spl13_3
| spl13_6 ),
inference(avatar_split_clause,[],[f180,f278,f263]) ).
fof(f180,plain,
( nil = sK3
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f276,plain,
( spl13_5
| spl13_2 ),
inference(avatar_split_clause,[],[f182,f258,f273]) ).
fof(f182,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f266,plain,
( spl13_3
| spl13_2 ),
inference(avatar_split_clause,[],[f184,f258,f263]) ).
fof(f184,plain,
( nil = sK2
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC356+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.15 % 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.13/0.36 % Computer : n025.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 03:14:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.36 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.52/0.70 % (27533)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.52/0.70 % (27535)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.70 % (27537)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.52/0.70 % (27539)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.52/0.70 % (27534)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.52/0.70 % (27538)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.52/0.70 % (27536)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.52/0.70 % (27540)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.52/0.71 % (27538)First to succeed.
% 0.52/0.71 % (27533)Instruction limit reached!
% 0.52/0.71 % (27533)------------------------------
% 0.52/0.71 % (27533)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.71 % (27533)Termination reason: Unknown
% 0.52/0.71 % (27533)Termination phase: Saturation
% 0.52/0.71
% 0.52/0.71 % (27533)Memory used [KB]: 1508
% 0.52/0.71 % (27533)Time elapsed: 0.012 s
% 0.52/0.71 % (27533)Instructions burned: 34 (million)
% 0.52/0.71 % (27533)------------------------------
% 0.52/0.71 % (27533)------------------------------
% 0.52/0.71 % (27538)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27532"
% 0.52/0.71 % (27541)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 (2996ds/55Mi)
% 0.52/0.71 % (27538)Refutation found. Thanks to Tanya!
% 0.52/0.71 % SZS status Theorem for theBenchmark
% 0.52/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.72 % (27538)------------------------------
% 0.52/0.72 % (27538)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.72 % (27538)Termination reason: Refutation
% 0.52/0.72
% 0.52/0.72 % (27538)Memory used [KB]: 1313
% 0.52/0.72 % (27538)Time elapsed: 0.014 s
% 0.52/0.72 % (27538)Instructions burned: 19 (million)
% 0.52/0.72 % (27532)Success in time 0.348 s
% 0.52/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------