TSTP Solution File: SWC053+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC053+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 : n004.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:35:51 EDT 2024
% Result : Theorem 0.67s 0.80s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 26
% Syntax : Number of formulae : 137 ( 7 unt; 0 def)
% Number of atoms : 708 ( 147 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 908 ( 337 ~; 337 |; 183 &)
% ( 18 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 162 ( 107 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1021,plain,
$false,
inference(avatar_sat_refutation,[],[f271,f276,f277,f287,f292,f297,f298,f299,f300,f301,f318,f337,f551,f649,f1007]) ).
fof(f1007,plain,
( ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_23
| ~ spl12_27 ),
inference(avatar_contradiction_clause,[],[f1006]) ).
fof(f1006,plain,
( $false
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_23
| ~ spl12_27 ),
inference(subsumption_resolution,[],[f1005,f957]) ).
fof(f957,plain,
( segmentP(sK2,sK4)
| ~ spl12_5
| ~ spl12_8
| ~ spl12_23 ),
inference(subsumption_resolution,[],[f956,f526]) ).
fof(f526,plain,
( ssList(sK5(sK2,sK4))
| ~ spl12_23 ),
inference(avatar_component_clause,[],[f525]) ).
fof(f525,plain,
( spl12_23
<=> ssList(sK5(sK2,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_23])]) ).
fof(f956,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f942,f296]) ).
fof(f296,plain,
( ssList(sK4)
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f294,plain,
( spl12_8
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f942,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(superposition,[],[f760,f515]) ).
fof(f515,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f514,f173]) ).
fof(f173,plain,
ssList(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = sK3 )
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f146,f145,f144,f143,f142]) ).
fof(f142,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = X3 )
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = X3 )
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = sK3 )
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) )
=> ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& 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)
=> ( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f514,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK2)
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f506,f296]) ).
fof(f506,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_5 ),
inference(resolution,[],[f205,f281]) ).
fof(f281,plain,
( frontsegP(sK2,sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f279,plain,
( spl12_5
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f205,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK5(X0,X1)) = X0
& ssList(sK5(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f154,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK5(X0,X1)) = X0
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,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,[],[f153]) ).
fof(f153,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,[],[f113]) ).
fof(f113,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(f760,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f759,f239]) ).
fof(f239,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,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(f759,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f754,f193]) ).
fof(f193,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f754,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f749]) ).
fof(f749,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f252,f237]) ).
fof(f237,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,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(f252,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,[],[f217]) ).
fof(f217,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,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0
& ssList(sK7(X0,X1))
& ssList(sK6(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f159,f161,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK6(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK6(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0
& ssList(sK7(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f159,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,[],[f158]) ).
fof(f158,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,[],[f123]) ).
fof(f123,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(f1005,plain,
( ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_27 ),
inference(subsumption_resolution,[],[f1004,f291]) ).
fof(f291,plain,
( neq(sK4,nil)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f289,plain,
( spl12_7
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f1004,plain,
( ~ neq(sK4,nil)
| ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_8
| ~ spl12_27 ),
inference(subsumption_resolution,[],[f999,f296]) ).
fof(f999,plain,
( ~ ssList(sK4)
| ~ neq(sK4,nil)
| ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_8
| ~ spl12_27 ),
inference(resolution,[],[f959,f265]) ).
fof(f265,plain,
( ! [X4] :
( ~ segmentP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK2,X4) )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f264,plain,
( spl12_2
<=> ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f959,plain,
( segmentP(sK3,sK4)
| ~ spl12_6
| ~ spl12_8
| ~ spl12_27 ),
inference(subsumption_resolution,[],[f958,f622]) ).
fof(f622,plain,
( ssList(sK5(sK3,sK4))
| ~ spl12_27 ),
inference(avatar_component_clause,[],[f621]) ).
fof(f621,plain,
( spl12_27
<=> ssList(sK5(sK3,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_27])]) ).
fof(f958,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f943,f296]) ).
fof(f943,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(superposition,[],[f760,f517]) ).
fof(f517,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f516,f174]) ).
fof(f174,plain,
ssList(sK3),
inference(cnf_transformation,[],[f147]) ).
fof(f516,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK3)
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f507,f296]) ).
fof(f507,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_6 ),
inference(resolution,[],[f205,f286]) ).
fof(f286,plain,
( frontsegP(sK3,sK4)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl12_6
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f649,plain,
( ~ spl12_6
| ~ spl12_8
| spl12_27 ),
inference(avatar_contradiction_clause,[],[f648]) ).
fof(f648,plain,
( $false
| ~ spl12_6
| ~ spl12_8
| spl12_27 ),
inference(subsumption_resolution,[],[f647,f174]) ).
fof(f647,plain,
( ~ ssList(sK3)
| ~ spl12_6
| ~ spl12_8
| spl12_27 ),
inference(subsumption_resolution,[],[f646,f296]) ).
fof(f646,plain,
( ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_6
| spl12_27 ),
inference(subsumption_resolution,[],[f645,f286]) ).
fof(f645,plain,
( ~ frontsegP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK3)
| spl12_27 ),
inference(resolution,[],[f623,f204]) ).
fof(f204,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f623,plain,
( ~ ssList(sK5(sK3,sK4))
| spl12_27 ),
inference(avatar_component_clause,[],[f621]) ).
fof(f551,plain,
( ~ spl12_5
| ~ spl12_8
| spl12_23 ),
inference(avatar_contradiction_clause,[],[f550]) ).
fof(f550,plain,
( $false
| ~ spl12_5
| ~ spl12_8
| spl12_23 ),
inference(subsumption_resolution,[],[f549,f173]) ).
fof(f549,plain,
( ~ ssList(sK2)
| ~ spl12_5
| ~ spl12_8
| spl12_23 ),
inference(subsumption_resolution,[],[f548,f296]) ).
fof(f548,plain,
( ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_5
| spl12_23 ),
inference(subsumption_resolution,[],[f547,f281]) ).
fof(f547,plain,
( ~ frontsegP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK2)
| spl12_23 ),
inference(resolution,[],[f527,f204]) ).
fof(f527,plain,
( ~ ssList(sK5(sK2,sK4))
| spl12_23 ),
inference(avatar_component_clause,[],[f525]) ).
fof(f337,plain,
( ~ spl12_3
| ~ spl12_4 ),
inference(avatar_contradiction_clause,[],[f336]) ).
fof(f336,plain,
( $false
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f334,f193]) ).
fof(f334,plain,
( ~ ssList(nil)
| ~ spl12_3
| ~ spl12_4 ),
inference(resolution,[],[f325,f258]) ).
fof(f258,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f246]) ).
fof(f246,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f189]) ).
fof(f189,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f325,plain,
( neq(nil,nil)
| ~ spl12_3
| ~ spl12_4 ),
inference(forward_demodulation,[],[f275,f270]) ).
fof(f270,plain,
( nil = sK3
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f268,plain,
( spl12_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f275,plain,
( neq(sK3,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f273,plain,
( spl12_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f318,plain,
( ~ spl12_3
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(avatar_contradiction_clause,[],[f317]) ).
fof(f317,plain,
( $false
| ~ spl12_3
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f315,f193]) ).
fof(f315,plain,
( ~ ssList(nil)
| ~ spl12_3
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(resolution,[],[f313,f258]) ).
fof(f313,plain,
( neq(nil,nil)
| ~ spl12_3
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(backward_demodulation,[],[f291,f310]) ).
fof(f310,plain,
( nil = sK4
| ~ spl12_3
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f307,f304]) ).
fof(f304,plain,
( frontsegP(nil,sK4)
| ~ spl12_3
| ~ spl12_6 ),
inference(backward_demodulation,[],[f286,f270]) ).
fof(f307,plain,
( ~ frontsegP(nil,sK4)
| nil = sK4
| ~ spl12_8 ),
inference(resolution,[],[f194,f296]) ).
fof(f194,plain,
! [X0] :
( ~ ssList(X0)
| ~ frontsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f301,plain,
( spl12_8
| spl12_3 ),
inference(avatar_split_clause,[],[f177,f268,f294]) ).
fof(f177,plain,
( nil = sK3
| ssList(sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f300,plain,
( spl12_7
| spl12_3 ),
inference(avatar_split_clause,[],[f178,f268,f289]) ).
fof(f178,plain,
( nil = sK3
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f147]) ).
fof(f299,plain,
( spl12_6
| spl12_3 ),
inference(avatar_split_clause,[],[f179,f268,f284]) ).
fof(f179,plain,
( nil = sK3
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f298,plain,
( spl12_5
| spl12_3 ),
inference(avatar_split_clause,[],[f180,f268,f279]) ).
fof(f180,plain,
( nil = sK3
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f297,plain,
( spl12_8
| spl12_1 ),
inference(avatar_split_clause,[],[f181,f260,f294]) ).
fof(f260,plain,
( spl12_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f181,plain,
( nil = sK2
| ssList(sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f292,plain,
( spl12_7
| spl12_1 ),
inference(avatar_split_clause,[],[f182,f260,f289]) ).
fof(f182,plain,
( nil = sK2
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f147]) ).
fof(f287,plain,
( spl12_6
| spl12_1 ),
inference(avatar_split_clause,[],[f183,f260,f284]) ).
fof(f183,plain,
( nil = sK2
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f277,plain,
( spl12_3
| spl12_4 ),
inference(avatar_split_clause,[],[f243,f273,f268]) ).
fof(f243,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f185,f175,f175]) ).
fof(f175,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f147]) ).
fof(f185,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f147]) ).
fof(f276,plain,
( ~ spl12_1
| spl12_4 ),
inference(avatar_split_clause,[],[f242,f273,f260]) ).
fof(f242,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f186,f175,f176]) ).
fof(f176,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f147]) ).
fof(f186,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f147]) ).
fof(f271,plain,
( spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f241,f264,f268]) ).
fof(f241,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f187,f176,f175,f175]) ).
fof(f187,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC053+1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.11 % 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.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:48:38 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.55/0.76 % (11356)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.76 % (11351)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.76 % (11354)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.76 % (11358)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.76 % (11355)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.76 % (11352)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.76 % (11357)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.77 % (11353)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.77 % (11354)Instruction limit reached!
% 0.55/0.77 % (11354)------------------------------
% 0.55/0.77 % (11354)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77 % (11354)Termination reason: Unknown
% 0.55/0.77 % (11354)Termination phase: Saturation
% 0.55/0.77 % (11355)Instruction limit reached!
% 0.55/0.77 % (11355)------------------------------
% 0.55/0.77 % (11355)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77
% 0.55/0.77 % (11354)Memory used [KB]: 1751
% 0.55/0.77 % (11354)Time elapsed: 0.019 s
% 0.55/0.77 % (11354)Instructions burned: 33 (million)
% 0.55/0.77 % (11354)------------------------------
% 0.55/0.77 % (11354)------------------------------
% 0.55/0.77 % (11355)Termination reason: Unknown
% 0.55/0.77 % (11355)Termination phase: Saturation
% 0.55/0.77
% 0.55/0.77 % (11355)Memory used [KB]: 2062
% 0.55/0.77 % (11355)Time elapsed: 0.018 s
% 0.55/0.77 % (11355)Instructions burned: 34 (million)
% 0.55/0.77 % (11355)------------------------------
% 0.55/0.77 % (11355)------------------------------
% 0.55/0.78 % (11356)Instruction limit reached!
% 0.55/0.78 % (11356)------------------------------
% 0.55/0.78 % (11356)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.78 % (11356)Termination reason: Unknown
% 0.55/0.78 % (11356)Termination phase: Saturation
% 0.55/0.78
% 0.55/0.78 % (11356)Memory used [KB]: 1556
% 0.55/0.78 % (11356)Time elapsed: 0.023 s
% 0.55/0.78 % (11356)Instructions burned: 46 (million)
% 0.55/0.78 % (11356)------------------------------
% 0.55/0.78 % (11356)------------------------------
% 0.55/0.78 % (11360)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.78 % (11351)Instruction limit reached!
% 0.55/0.78 % (11351)------------------------------
% 0.55/0.78 % (11351)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.78 % (11351)Termination reason: Unknown
% 0.55/0.78 % (11351)Termination phase: Saturation
% 0.55/0.78
% 0.55/0.78 % (11351)Memory used [KB]: 1450
% 0.55/0.78 % (11351)Time elapsed: 0.022 s
% 0.55/0.78 % (11351)Instructions burned: 35 (million)
% 0.55/0.78 % (11351)------------------------------
% 0.55/0.78 % (11351)------------------------------
% 0.67/0.78 % (11362)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.67/0.78 % (11361)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.67/0.78 % (11363)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.67/0.78 % (11358)Instruction limit reached!
% 0.67/0.78 % (11358)------------------------------
% 0.67/0.78 % (11358)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.79 % (11358)Termination reason: Unknown
% 0.67/0.79 % (11358)Termination phase: Saturation
% 0.67/0.79
% 0.67/0.79 % (11358)Memory used [KB]: 1712
% 0.67/0.79 % (11358)Time elapsed: 0.029 s
% 0.67/0.79 % (11358)Instructions burned: 56 (million)
% 0.67/0.79 % (11358)------------------------------
% 0.67/0.79 % (11358)------------------------------
% 0.67/0.79 % (11352)Instruction limit reached!
% 0.67/0.79 % (11352)------------------------------
% 0.67/0.79 % (11352)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.79 % (11352)Termination reason: Unknown
% 0.67/0.79 % (11352)Termination phase: Saturation
% 0.67/0.79
% 0.67/0.79 % (11352)Memory used [KB]: 1986
% 0.67/0.79 % (11352)Time elapsed: 0.032 s
% 0.67/0.79 % (11352)Instructions burned: 52 (million)
% 0.67/0.79 % (11352)------------------------------
% 0.67/0.79 % (11352)------------------------------
% 0.67/0.79 % (11366)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.67/0.79 % (11353)First to succeed.
% 0.67/0.79 % (11377)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.67/0.79 % (11353)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11333"
% 0.67/0.80 % (11353)Refutation found. Thanks to Tanya!
% 0.67/0.80 % SZS status Theorem for theBenchmark
% 0.67/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.67/0.80 % (11353)------------------------------
% 0.67/0.80 % (11353)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.80 % (11353)Termination reason: Refutation
% 0.67/0.80
% 0.67/0.80 % (11353)Memory used [KB]: 1504
% 0.67/0.80 % (11353)Time elapsed: 0.028 s
% 0.67/0.80 % (11353)Instructions burned: 43 (million)
% 0.67/0.80 % (11333)Success in time 0.473 s
% 0.67/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------