TSTP Solution File: SWC081+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC081+1 : TPTP v8.1.2. 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 : n014.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 : Wed May 1 03:59:39 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 22
% Syntax : Number of formulae : 110 ( 11 unt; 0 def)
% Number of atoms : 589 ( 102 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 753 ( 274 ~; 266 |; 168 &)
% ( 13 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 156 ( 101 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f913,plain,
$false,
inference(avatar_sat_refutation,[],[f283,f284,f285,f286,f302,f546,f642,f903]) ).
fof(f903,plain,
( ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| ~ spl12_15
| ~ spl12_19 ),
inference(avatar_contradiction_clause,[],[f902]) ).
fof(f902,plain,
( $false
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| ~ spl12_15
| ~ spl12_19 ),
inference(subsumption_resolution,[],[f901,f277]) ).
fof(f277,plain,
( ssList(sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f275,plain,
( spl12_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f901,plain,
( ~ ssList(sK4)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| ~ spl12_15
| ~ spl12_19 ),
inference(subsumption_resolution,[],[f900,f272]) ).
fof(f272,plain,
( neq(sK4,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl12_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f900,plain,
( ~ neq(sK4,nil)
| ~ ssList(sK4)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_5
| ~ spl12_15
| ~ spl12_19 ),
inference(subsumption_resolution,[],[f896,f894]) ).
fof(f894,plain,
( segmentP(sK3,sK4)
| ~ spl12_3
| ~ spl12_5
| ~ spl12_19 ),
inference(subsumption_resolution,[],[f893,f615]) ).
fof(f615,plain,
( ssList(sK5(sK3,sK4))
| ~ spl12_19 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f614,plain,
( spl12_19
<=> ssList(sK5(sK3,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_19])]) ).
fof(f893,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_3
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f884,f277]) ).
fof(f884,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_3
| ~ spl12_5 ),
inference(superposition,[],[f777,f508]) ).
fof(f508,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ spl12_3
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f507,f174]) ).
fof(f174,plain,
ssList(sK3),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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])],[f100,f146,f145,f144,f143,f142]) ).
fof(f142,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(sK3,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ 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 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',co1) ).
fof(f507,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK3)
| ~ spl12_3
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f496,f277]) ).
fof(f496,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_3 ),
inference(resolution,[],[f203,f267]) ).
fof(f267,plain,
( frontsegP(sK3,sK4)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f265,plain,
( spl12_3
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f203,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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax5) ).
fof(f777,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f776,f237]) ).
fof(f237,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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax26) ).
fof(f776,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f772,f191]) ).
fof(f191,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax17) ).
fof(f772,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f767]) ).
fof(f767,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f248,f235]) ).
fof(f235,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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax28) ).
fof(f248,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,[],[f215]) ).
fof(f215,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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax7) ).
fof(f896,plain,
( ~ segmentP(sK3,sK4)
| ~ neq(sK4,nil)
| ~ ssList(sK4)
| ~ spl12_1
| ~ spl12_5
| ~ spl12_15 ),
inference(resolution,[],[f892,f238]) ).
fof(f238,plain,
! [X5] :
( ~ segmentP(sK2,X5)
| ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f178,f176,f175]) ).
fof(f175,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f147]) ).
fof(f176,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f147]) ).
fof(f178,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f147]) ).
fof(f892,plain,
( segmentP(sK2,sK4)
| ~ spl12_1
| ~ spl12_5
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f891,f518]) ).
fof(f518,plain,
( ssList(sK5(sK2,sK4))
| ~ spl12_15 ),
inference(avatar_component_clause,[],[f517]) ).
fof(f517,plain,
( spl12_15
<=> ssList(sK5(sK2,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_15])]) ).
fof(f891,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_1
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f883,f277]) ).
fof(f883,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_1
| ~ spl12_5 ),
inference(superposition,[],[f777,f506]) ).
fof(f506,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ spl12_1
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f505,f173]) ).
fof(f173,plain,
ssList(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f505,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK2)
| ~ spl12_1
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f495,f277]) ).
fof(f495,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_1 ),
inference(resolution,[],[f203,f258]) ).
fof(f258,plain,
( frontsegP(sK2,sK4)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl12_1
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f642,plain,
( ~ spl12_3
| ~ spl12_5
| spl12_19 ),
inference(avatar_contradiction_clause,[],[f641]) ).
fof(f641,plain,
( $false
| ~ spl12_3
| ~ spl12_5
| spl12_19 ),
inference(subsumption_resolution,[],[f640,f174]) ).
fof(f640,plain,
( ~ ssList(sK3)
| ~ spl12_3
| ~ spl12_5
| spl12_19 ),
inference(subsumption_resolution,[],[f639,f277]) ).
fof(f639,plain,
( ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_3
| spl12_19 ),
inference(subsumption_resolution,[],[f638,f267]) ).
fof(f638,plain,
( ~ frontsegP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK3)
| spl12_19 ),
inference(resolution,[],[f616,f202]) ).
fof(f202,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f616,plain,
( ~ ssList(sK5(sK3,sK4))
| spl12_19 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f546,plain,
( ~ spl12_1
| ~ spl12_5
| spl12_15 ),
inference(avatar_contradiction_clause,[],[f545]) ).
fof(f545,plain,
( $false
| ~ spl12_1
| ~ spl12_5
| spl12_15 ),
inference(subsumption_resolution,[],[f544,f173]) ).
fof(f544,plain,
( ~ ssList(sK2)
| ~ spl12_1
| ~ spl12_5
| spl12_15 ),
inference(subsumption_resolution,[],[f543,f277]) ).
fof(f543,plain,
( ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_1
| spl12_15 ),
inference(subsumption_resolution,[],[f542,f258]) ).
fof(f542,plain,
( ~ frontsegP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK2)
| spl12_15 ),
inference(resolution,[],[f519,f202]) ).
fof(f519,plain,
( ~ ssList(sK5(sK2,sK4))
| spl12_15 ),
inference(avatar_component_clause,[],[f517]) ).
fof(f302,plain,
~ spl12_6,
inference(avatar_contradiction_clause,[],[f301]) ).
fof(f301,plain,
( $false
| ~ spl12_6 ),
inference(subsumption_resolution,[],[f300,f290]) ).
fof(f290,plain,
( neq(nil,nil)
| ~ spl12_6 ),
inference(backward_demodulation,[],[f239,f282]) ).
fof(f282,plain,
( nil = sK3
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f280,plain,
( spl12_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f239,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f177,f175]) ).
fof(f177,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f147]) ).
fof(f300,plain,
~ neq(nil,nil),
inference(resolution,[],[f254,f191]) ).
fof(f254,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(duplicate_literal_removal,[],[f242]) ).
fof(f242,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f187,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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843',ax15) ).
fof(f286,plain,
( spl12_5
| spl12_6 ),
inference(avatar_split_clause,[],[f179,f280,f275]) ).
fof(f179,plain,
( nil = sK3
| ssList(sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f285,plain,
( spl12_4
| spl12_6 ),
inference(avatar_split_clause,[],[f180,f280,f270]) ).
fof(f180,plain,
( nil = sK3
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f147]) ).
fof(f284,plain,
( spl12_3
| spl12_6 ),
inference(avatar_split_clause,[],[f181,f280,f265]) ).
fof(f181,plain,
( nil = sK3
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f147]) ).
fof(f283,plain,
( spl12_1
| spl12_6 ),
inference(avatar_split_clause,[],[f182,f280,f256]) ).
fof(f182,plain,
( nil = sK3
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/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.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:10:18 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/tmp/tmp.BO6lEfq4ZX/Vampire---4.8_2843
% 0.55/0.76 % (3031)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.76 % (3026)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.76 % (3028)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.76 % (3029)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.76 % (3027)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 Vampire---4 for (2996ds/51Mi)
% 0.55/0.76 % (3032)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 Vampire---4 for (2996ds/83Mi)
% 0.55/0.76 % (3033)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.55/0.77 % (3030)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.77 % (3031)Instruction limit reached!
% 0.55/0.77 % (3031)------------------------------
% 0.55/0.77 % (3031)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.77 % (3031)Termination reason: Unknown
% 0.55/0.77 % (3031)Termination phase: Saturation
% 0.55/0.77
% 0.55/0.77 % (3031)Memory used [KB]: 1488
% 0.55/0.77 % (3031)Time elapsed: 0.014 s
% 0.55/0.77 % (3031)Instructions burned: 48 (million)
% 0.55/0.77 % (3031)------------------------------
% 0.55/0.77 % (3031)------------------------------
% 0.55/0.77 % (3034)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 Vampire---4 for (2996ds/55Mi)
% 0.61/0.78 % (3029)Instruction limit reached!
% 0.61/0.78 % (3029)------------------------------
% 0.61/0.78 % (3029)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (3029)Termination reason: Unknown
% 0.61/0.78 % (3029)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (3029)Memory used [KB]: 1725
% 0.61/0.78 % (3029)Time elapsed: 0.019 s
% 0.61/0.78 % (3029)Instructions burned: 33 (million)
% 0.61/0.78 % (3029)------------------------------
% 0.61/0.78 % (3029)------------------------------
% 0.61/0.78 % (3030)Instruction limit reached!
% 0.61/0.78 % (3030)------------------------------
% 0.61/0.78 % (3030)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (3030)Termination reason: Unknown
% 0.61/0.78 % (3030)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (3030)Memory used [KB]: 2007
% 0.61/0.78 % (3030)Time elapsed: 0.012 s
% 0.61/0.78 % (3030)Instructions burned: 35 (million)
% 0.61/0.78 % (3030)------------------------------
% 0.61/0.78 % (3030)------------------------------
% 0.61/0.78 % (3026)Instruction limit reached!
% 0.61/0.78 % (3026)------------------------------
% 0.61/0.78 % (3026)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (3026)Termination reason: Unknown
% 0.61/0.78 % (3026)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (3026)Memory used [KB]: 1480
% 0.61/0.78 % (3026)Time elapsed: 0.021 s
% 0.61/0.78 % (3026)Instructions burned: 35 (million)
% 0.61/0.78 % (3026)------------------------------
% 0.61/0.78 % (3026)------------------------------
% 0.61/0.78 % (3036)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.61/0.78 % (3035)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 Vampire---4 for (2996ds/50Mi)
% 0.61/0.78 % (3028)First to succeed.
% 0.61/0.78 % (3037)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 Vampire---4 for (2996ds/52Mi)
% 0.61/0.79 % (3028)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (3028)------------------------------
% 0.61/0.79 % (3028)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (3028)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (3028)Memory used [KB]: 1471
% 0.61/0.79 % (3028)Time elapsed: 0.028 s
% 0.61/0.79 % (3028)Instructions burned: 40 (million)
% 0.61/0.79 % (3028)------------------------------
% 0.61/0.79 % (3028)------------------------------
% 0.61/0.79 % (3015)Success in time 0.406 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------