TSTP Solution File: SWC070+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC070+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 : 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:36:00 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 85 ( 7 unt; 0 def)
% Number of atoms : 459 ( 120 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 592 ( 218 ~; 205 |; 137 &)
% ( 9 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 87 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f847,plain,
$false,
inference(avatar_sat_refutation,[],[f257,f262,f267,f268,f269,f456,f846]) ).
fof(f846,plain,
( ~ spl11_2
| ~ spl11_4
| ~ spl11_15 ),
inference(avatar_contradiction_clause,[],[f845]) ).
fof(f845,plain,
( $false
| ~ spl11_2
| ~ spl11_4
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f844,f171]) ).
fof(f171,plain,
ssList(sK2),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f144,f143,f142,f141]) ).
fof(f141,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f844,plain,
( ~ ssList(sK2)
| ~ spl11_2
| ~ spl11_4
| ~ spl11_15 ),
inference(resolution,[],[f816,f203]) ).
fof(f203,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(f816,plain,
( ~ segmentP(sK2,sK2)
| ~ spl11_2
| ~ spl11_4
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f815,f171]) ).
fof(f815,plain,
( ~ segmentP(sK2,sK2)
| ~ ssList(sK2)
| ~ spl11_2
| ~ spl11_4
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f810,f266]) ).
fof(f266,plain,
( neq(sK2,nil)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f264,plain,
( spl11_4
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f810,plain,
( ~ segmentP(sK2,sK2)
| ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ spl11_2
| ~ spl11_15 ),
inference(resolution,[],[f809,f233]) ).
fof(f233,plain,
! [X4] :
( ~ segmentP(sK3,X4)
| ~ segmentP(sK2,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f175,f174,f173]) ).
fof(f173,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f145]) ).
fof(f174,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f145]) ).
fof(f175,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f145]) ).
fof(f809,plain,
( segmentP(sK3,sK2)
| ~ spl11_2
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f808,f436]) ).
fof(f436,plain,
( ssList(sK4(sK3,sK2))
| ~ spl11_15 ),
inference(avatar_component_clause,[],[f435]) ).
fof(f435,plain,
( spl11_15
<=> ssList(sK4(sK3,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_15])]) ).
fof(f808,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4(sK3,sK2))
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f796,f171]) ).
fof(f796,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK4(sK3,sK2))
| ~ spl11_2 ),
inference(superposition,[],[f649,f427]) ).
fof(f427,plain,
( sK3 = app(sK2,sK4(sK3,sK2))
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f426,f172]) ).
fof(f172,plain,
ssList(sK3),
inference(cnf_transformation,[],[f145]) ).
fof(f426,plain,
( sK3 = app(sK2,sK4(sK3,sK2))
| ~ ssList(sK3)
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f419,f171]) ).
fof(f419,plain,
( sK3 = app(sK2,sK4(sK3,sK2))
| ~ ssList(sK2)
| ~ ssList(sK3)
| ~ spl11_2 ),
inference(resolution,[],[f197,f256]) ).
fof(f256,plain,
( frontsegP(sK3,sK2)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f254,plain,
( spl11_2
<=> frontsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f197,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK4(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK4(X0,X1)) = X0
& ssList(sK4(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f152,f153]) ).
fof(f153,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK4(X0,X1)) = X0
& ssList(sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f649,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f648,f231]) ).
fof(f231,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,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(f648,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f645,f185]) ).
fof(f185,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f645,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f640]) ).
fof(f640,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f242,f229]) ).
fof(f229,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f242,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,[],[f209]) ).
fof(f209,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,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1))
& ssList(sK5(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f157,f159,f158]) ).
fof(f158,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f157,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,[],[f156]) ).
fof(f156,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(f456,plain,
( ~ spl11_2
| spl11_15 ),
inference(avatar_contradiction_clause,[],[f455]) ).
fof(f455,plain,
( $false
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f454,f172]) ).
fof(f454,plain,
( ~ ssList(sK3)
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f453,f171]) ).
fof(f453,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f452,f256]) ).
fof(f452,plain,
( ~ frontsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl11_15 ),
inference(resolution,[],[f437,f196]) ).
fof(f196,plain,
! [X0,X1] :
( ssList(sK4(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f437,plain,
( ~ ssList(sK4(sK3,sK2))
| spl11_15 ),
inference(avatar_component_clause,[],[f435]) ).
fof(f269,plain,
( ~ spl11_3
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f232,f250,f259]) ).
fof(f259,plain,
( spl11_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f250,plain,
( spl11_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f232,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f176,f174,f173]) ).
fof(f176,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f145]) ).
fof(f268,plain,
( spl11_3
| spl11_4 ),
inference(avatar_split_clause,[],[f177,f264,f259]) ).
fof(f177,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f145]) ).
fof(f267,plain,
( spl11_1
| spl11_4 ),
inference(avatar_split_clause,[],[f178,f264,f250]) ).
fof(f178,plain,
( neq(sK2,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
fof(f262,plain,
( spl11_3
| spl11_2 ),
inference(avatar_split_clause,[],[f179,f254,f259]) ).
fof(f179,plain,
( frontsegP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f145]) ).
fof(f257,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f180,f254,f250]) ).
fof(f180,plain,
( frontsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC070+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % 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.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:23:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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.53/0.73 % (26852)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.53/0.73 % (26845)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.53/0.73 % (26847)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73 % (26848)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.53/0.73 % (26849)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.53/0.73 % (26846)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.53/0.73 % (26850)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.53/0.73 % (26851)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.53/0.75 % (26848)Instruction limit reached!
% 0.53/0.75 % (26848)------------------------------
% 0.53/0.75 % (26848)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (26848)Termination reason: Unknown
% 0.53/0.75 % (26848)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (26848)Memory used [KB]: 1687
% 0.53/0.75 % (26848)Time elapsed: 0.019 s
% 0.53/0.75 % (26848)Instructions burned: 34 (million)
% 0.53/0.75 % (26848)------------------------------
% 0.53/0.75 % (26848)------------------------------
% 0.53/0.75 % (26852)Instruction limit reached!
% 0.53/0.75 % (26852)------------------------------
% 0.53/0.75 % (26852)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (26852)Termination reason: Unknown
% 0.53/0.75 % (26852)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (26852)Memory used [KB]: 1718
% 0.53/0.75 % (26852)Time elapsed: 0.020 s
% 0.53/0.75 % (26852)Instructions burned: 59 (million)
% 0.53/0.75 % (26852)------------------------------
% 0.53/0.75 % (26852)------------------------------
% 0.58/0.75 % (26849)Instruction limit reached!
% 0.58/0.75 % (26849)------------------------------
% 0.58/0.75 % (26849)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (26849)Termination reason: Unknown
% 0.58/0.75 % (26849)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (26849)Memory used [KB]: 1971
% 0.58/0.75 % (26849)Time elapsed: 0.020 s
% 0.58/0.75 % (26849)Instructions burned: 34 (million)
% 0.58/0.75 % (26849)------------------------------
% 0.58/0.75 % (26849)------------------------------
% 0.58/0.75 % (26845)Instruction limit reached!
% 0.58/0.75 % (26845)------------------------------
% 0.58/0.75 % (26845)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (26845)Termination reason: Unknown
% 0.58/0.75 % (26845)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (26845)Memory used [KB]: 1442
% 0.58/0.75 % (26845)Time elapsed: 0.021 s
% 0.58/0.75 % (26845)Instructions burned: 34 (million)
% 0.58/0.75 % (26845)------------------------------
% 0.58/0.75 % (26845)------------------------------
% 0.58/0.75 % (26847)First to succeed.
% 0.58/0.75 % (26856)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.58/0.75 % (26850)Instruction limit reached!
% 0.58/0.75 % (26850)------------------------------
% 0.58/0.75 % (26850)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (26850)Termination reason: Unknown
% 0.58/0.75 % (26850)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (26850)Memory used [KB]: 1434
% 0.58/0.75 % (26850)Time elapsed: 0.023 s
% 0.58/0.75 % (26850)Instructions burned: 46 (million)
% 0.58/0.75 % (26850)------------------------------
% 0.58/0.75 % (26850)------------------------------
% 0.58/0.75 % (26847)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26844"
% 0.58/0.75 % (26857)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 (2996ds/50Mi)
% 0.58/0.76 % (26847)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for theBenchmark
% 0.58/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.76 % (26847)------------------------------
% 0.58/0.76 % (26847)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (26847)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (26847)Memory used [KB]: 1430
% 0.58/0.76 % (26847)Time elapsed: 0.023 s
% 0.58/0.76 % (26847)Instructions burned: 34 (million)
% 0.58/0.76 % (26844)Success in time 0.394 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------