TSTP Solution File: SWC052+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC052+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 : n023.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:26 EDT 2024
% Result : Theorem 0.65s 0.75s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of formulae : 112 ( 7 unt; 0 def)
% Number of atoms : 625 ( 125 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 831 ( 318 ~; 304 |; 171 &)
% ( 14 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 144 ( 94 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f873,plain,
$false,
inference(avatar_sat_refutation,[],[f262,f267,f272,f273,f278,f283,f288,f293,f294,f454,f523,f863]) ).
fof(f863,plain,
( ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_13
| ~ spl12_15 ),
inference(avatar_contradiction_clause,[],[f862]) ).
fof(f862,plain,
( $false
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_13
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f861,f816]) ).
fof(f816,plain,
( segmentP(sK2,sK4)
| ~ spl12_5
| ~ spl12_8
| ~ spl12_13 ),
inference(subsumption_resolution,[],[f815,f428]) ).
fof(f428,plain,
( ssList(sK5(sK2,sK4))
| ~ spl12_13 ),
inference(avatar_component_clause,[],[f427]) ).
fof(f427,plain,
( spl12_13
<=> ssList(sK5(sK2,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_13])]) ).
fof(f815,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f803,f292]) ).
fof(f292,plain,
( ssList(sK4)
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f290,plain,
( spl12_8
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f803,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(superposition,[],[f642,f416]) ).
fof(f416,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f415,f172]) ).
fof(f172,plain,
ssList(sK2),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& 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,f145,f144,f143,f142,f141]) ).
fof(f141,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& 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 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& 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 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& 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 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& 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 ) )
& ( ~ neq(sK3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f145,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(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 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& 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] :
( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X5] :
( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',co1) ).
fof(f415,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK2)
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f405,f292]) ).
fof(f405,plain,
( sK2 = app(sK4,sK5(sK2,sK4))
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_5 ),
inference(resolution,[],[f201,f277]) ).
fof(f277,plain,
( frontsegP(sK2,sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f275,plain,
( spl12_5
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f201,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,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])],[f153,f154]) ).
fof(f154,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK5(X0,X1)) = X0
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f153,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,[],[f152]) ).
fof(f152,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/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',ax5) ).
fof(f642,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f641,f235]) ).
fof(f235,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/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',ax26) ).
fof(f641,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f638,f189]) ).
fof(f189,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',ax17) ).
fof(f638,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f633]) ).
fof(f633,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f248,f233]) ).
fof(f233,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/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',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,[],[f213]) ).
fof(f213,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,[],[f161]) ).
fof(f161,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])],[f158,f160,f159]) ).
fof(f159,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(f160,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(f158,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,[],[f157]) ).
fof(f157,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/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687',ax7) ).
fof(f861,plain,
( ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f860,f287]) ).
fof(f287,plain,
( neq(sK4,nil)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f285]) ).
fof(f285,plain,
( spl12_7
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f860,plain,
( ~ neq(sK4,nil)
| ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_8
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f855,f292]) ).
fof(f855,plain,
( ~ ssList(sK4)
| ~ neq(sK4,nil)
| ~ segmentP(sK2,sK4)
| ~ spl12_2
| ~ spl12_6
| ~ spl12_8
| ~ spl12_15 ),
inference(resolution,[],[f818,f261]) ).
fof(f261,plain,
( ! [X4] :
( ~ segmentP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK2,X4) )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f260,plain,
( spl12_2
<=> ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f818,plain,
( segmentP(sK3,sK4)
| ~ spl12_6
| ~ spl12_8
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f817,f488]) ).
fof(f488,plain,
( ssList(sK5(sK3,sK4))
| ~ spl12_15 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f487,plain,
( spl12_15
<=> ssList(sK5(sK3,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_15])]) ).
fof(f817,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f804,f292]) ).
fof(f804,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(superposition,[],[f642,f418]) ).
fof(f418,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f417,f173]) ).
fof(f173,plain,
ssList(sK3),
inference(cnf_transformation,[],[f146]) ).
fof(f417,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK3)
| ~ spl12_6
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f406,f292]) ).
fof(f406,plain,
( sK3 = app(sK4,sK5(sK3,sK4))
| ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_6 ),
inference(resolution,[],[f201,f282]) ).
fof(f282,plain,
( frontsegP(sK3,sK4)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f280,plain,
( spl12_6
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f523,plain,
( ~ spl12_6
| ~ spl12_8
| spl12_15 ),
inference(avatar_contradiction_clause,[],[f522]) ).
fof(f522,plain,
( $false
| ~ spl12_6
| ~ spl12_8
| spl12_15 ),
inference(subsumption_resolution,[],[f521,f173]) ).
fof(f521,plain,
( ~ ssList(sK3)
| ~ spl12_6
| ~ spl12_8
| spl12_15 ),
inference(subsumption_resolution,[],[f520,f292]) ).
fof(f520,plain,
( ~ ssList(sK4)
| ~ ssList(sK3)
| ~ spl12_6
| spl12_15 ),
inference(subsumption_resolution,[],[f519,f282]) ).
fof(f519,plain,
( ~ frontsegP(sK3,sK4)
| ~ ssList(sK4)
| ~ ssList(sK3)
| spl12_15 ),
inference(resolution,[],[f489,f200]) ).
fof(f200,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f489,plain,
( ~ ssList(sK5(sK3,sK4))
| spl12_15 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f454,plain,
( ~ spl12_5
| ~ spl12_8
| spl12_13 ),
inference(avatar_contradiction_clause,[],[f453]) ).
fof(f453,plain,
( $false
| ~ spl12_5
| ~ spl12_8
| spl12_13 ),
inference(subsumption_resolution,[],[f452,f172]) ).
fof(f452,plain,
( ~ ssList(sK2)
| ~ spl12_5
| ~ spl12_8
| spl12_13 ),
inference(subsumption_resolution,[],[f451,f292]) ).
fof(f451,plain,
( ~ ssList(sK4)
| ~ ssList(sK2)
| ~ spl12_5
| spl12_13 ),
inference(subsumption_resolution,[],[f450,f277]) ).
fof(f450,plain,
( ~ frontsegP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK2)
| spl12_13 ),
inference(resolution,[],[f429,f200]) ).
fof(f429,plain,
( ~ ssList(sK5(sK2,sK4))
| spl12_13 ),
inference(avatar_component_clause,[],[f427]) ).
fof(f294,plain,
( spl12_1
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f176,f264,f256]) ).
fof(f256,plain,
( spl12_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f264,plain,
( spl12_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f176,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f146]) ).
fof(f293,plain,
( spl12_8
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f177,f269,f290]) ).
fof(f269,plain,
( spl12_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f177,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f146]) ).
fof(f288,plain,
( spl12_7
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f178,f269,f285]) ).
fof(f178,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f146]) ).
fof(f283,plain,
( spl12_6
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f179,f269,f280]) ).
fof(f179,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f146]) ).
fof(f278,plain,
( spl12_5
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f180,f269,f275]) ).
fof(f180,plain,
( ~ neq(sK3,nil)
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f146]) ).
fof(f273,plain,
( spl12_3
| spl12_4 ),
inference(avatar_split_clause,[],[f239,f269,f264]) ).
fof(f239,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f181,f174,f174]) ).
fof(f174,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f146]) ).
fof(f181,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f146]) ).
fof(f272,plain,
( ~ spl12_1
| spl12_4 ),
inference(avatar_split_clause,[],[f238,f269,f256]) ).
fof(f238,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f182,f174,f175]) ).
fof(f175,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f146]) ).
fof(f182,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f146]) ).
fof(f267,plain,
( spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f237,f260,f264]) ).
fof(f237,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f183,f175,f174,f174]) ).
fof(f183,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f146]) ).
fof(f262,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f236,f260,f256]) ).
fof(f236,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK2 ),
inference(definition_unfolding,[],[f184,f175,f174,f175]) ).
fof(f184,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC052+1 : TPTP v8.1.2. 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.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:32:25 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/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/tmp/tmp.3SYBQONuYg/Vampire---4.8_13687
% 0.54/0.73 % (13856)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.54/0.73 % (13851)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.54/0.73 % (13853)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.54/0.73 % (13852)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.54/0.73 % (13854)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.54/0.73 % (13855)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.54/0.73 % (13857)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.54/0.74 % (13858)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.54/0.74 % (13856)Instruction limit reached!
% 0.54/0.74 % (13856)------------------------------
% 0.54/0.74 % (13856)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.74 % (13856)Termination reason: Unknown
% 0.54/0.74 % (13856)Termination phase: Saturation
% 0.54/0.74
% 0.54/0.74 % (13856)Memory used [KB]: 1466
% 0.54/0.74 % (13856)Time elapsed: 0.014 s
% 0.54/0.74 % (13856)Instructions burned: 45 (million)
% 0.54/0.74 % (13856)------------------------------
% 0.54/0.74 % (13856)------------------------------
% 0.54/0.75 % (13854)Instruction limit reached!
% 0.54/0.75 % (13854)------------------------------
% 0.54/0.75 % (13854)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.75 % (13854)Termination reason: Unknown
% 0.54/0.75 % (13854)Termination phase: Saturation
% 0.54/0.75
% 0.54/0.75 % (13854)Memory used [KB]: 1739
% 0.54/0.75 % (13854)Time elapsed: 0.019 s
% 0.54/0.75 % (13854)Instructions burned: 34 (million)
% 0.54/0.75 % (13854)------------------------------
% 0.54/0.75 % (13854)------------------------------
% 0.54/0.75 % (13855)Instruction limit reached!
% 0.54/0.75 % (13855)------------------------------
% 0.54/0.75 % (13855)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.75 % (13855)Termination reason: Unknown
% 0.54/0.75 % (13855)Termination phase: Saturation
% 0.54/0.75
% 0.54/0.75 % (13855)Memory used [KB]: 1992
% 0.54/0.75 % (13855)Time elapsed: 0.020 s
% 0.54/0.75 % (13855)Instructions burned: 34 (million)
% 0.54/0.75 % (13855)------------------------------
% 0.54/0.75 % (13855)------------------------------
% 0.54/0.75 % (13851)Instruction limit reached!
% 0.54/0.75 % (13851)------------------------------
% 0.54/0.75 % (13851)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.75 % (13851)Termination reason: Unknown
% 0.54/0.75 % (13851)Termination phase: Saturation
% 0.54/0.75
% 0.54/0.75 % (13851)Memory used [KB]: 1452
% 0.54/0.75 % (13851)Time elapsed: 0.021 s
% 0.54/0.75 % (13851)Instructions burned: 34 (million)
% 0.54/0.75 % (13851)------------------------------
% 0.54/0.75 % (13851)------------------------------
% 0.65/0.75 % (13853)First to succeed.
% 0.65/0.75 % (13860)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.65/0.75 % (13861)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.65/0.75 % (13859)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.65/0.75 % (13853)Refutation found. Thanks to Tanya!
% 0.65/0.75 % SZS status Theorem for Vampire---4
% 0.65/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.75 % (13853)------------------------------
% 0.65/0.75 % (13853)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.75 % (13853)Termination reason: Refutation
% 0.65/0.75
% 0.65/0.75 % (13853)Memory used [KB]: 1459
% 0.65/0.75 % (13853)Time elapsed: 0.018 s
% 0.65/0.75 % (13853)Instructions burned: 38 (million)
% 0.65/0.75 % (13853)------------------------------
% 0.65/0.75 % (13853)------------------------------
% 0.65/0.75 % (13850)Success in time 0.39 s
% 0.65/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------