TSTP Solution File: SWC124+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC124+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 : n021.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:56 EDT 2024
% Result : Theorem 0.67s 0.85s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of formulae : 96 ( 13 unt; 0 def)
% Number of atoms : 567 ( 163 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 771 ( 300 ~; 268 |; 162 &)
% ( 10 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 207 ( 152 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1235,plain,
$false,
inference(avatar_sat_refutation,[],[f278,f287,f306,f339,f1207,f1218,f1234]) ).
fof(f1234,plain,
( spl17_2
| ~ spl17_22 ),
inference(avatar_contradiction_clause,[],[f1233]) ).
fof(f1233,plain,
( $false
| spl17_2
| ~ spl17_22 ),
inference(subsumption_resolution,[],[f1232,f187]) ).
fof(f187,plain,
ssList(sK4),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK2
| nil = sK3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f150,f149,f148,f147,f146]) ).
fof(f146,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ totalorderedP(X2)
| app(X2,X4) != X3 ) )
| ~ 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)
=> ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ totalorderedP(X2)
| app(X2,X4) != X3 ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WVEenmXwtH/Vampire---4.8_10832',co1) ).
fof(f1232,plain,
( ~ ssList(sK4)
| spl17_2
| ~ spl17_22 ),
inference(subsumption_resolution,[],[f1231,f183]) ).
fof(f183,plain,
ssList(sK3),
inference(cnf_transformation,[],[f151]) ).
fof(f1231,plain,
( ~ ssList(sK3)
| ~ ssList(sK4)
| spl17_2
| ~ spl17_22 ),
inference(subsumption_resolution,[],[f1225,f277]) ).
fof(f277,plain,
( ~ segmentP(sK3,sK2)
| spl17_2 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f275,plain,
( spl17_2
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f1225,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ ssList(sK4)
| ~ spl17_22 ),
inference(superposition,[],[f1206,f188]) ).
fof(f188,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f151]) ).
fof(f1206,plain,
( ! [X1] :
( segmentP(app(sK2,X1),sK2)
| ~ ssList(app(sK2,X1))
| ~ ssList(X1) )
| ~ spl17_22 ),
inference(avatar_component_clause,[],[f1205]) ).
fof(f1205,plain,
( spl17_22
<=> ! [X1] :
( segmentP(app(sK2,X1),sK2)
| ~ ssList(app(sK2,X1))
| ~ ssList(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_22])]) ).
fof(f1218,plain,
~ spl17_20,
inference(avatar_contradiction_clause,[],[f1217]) ).
fof(f1217,plain,
( $false
| ~ spl17_20 ),
inference(subsumption_resolution,[],[f1216,f183]) ).
fof(f1216,plain,
( ~ ssList(sK3)
| ~ spl17_20 ),
inference(subsumption_resolution,[],[f1215,f219]) ).
fof(f219,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.WVEenmXwtH/Vampire---4.8_10832',ax17) ).
fof(f1215,plain,
( ~ ssList(nil)
| ~ ssList(sK3)
| ~ spl17_20 ),
inference(trivial_inequality_removal,[],[f1213]) ).
fof(f1213,plain,
( sK3 != sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ spl17_20 ),
inference(superposition,[],[f1197,f212]) ).
fof(f212,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,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.WVEenmXwtH/Vampire---4.8_10832',ax28) ).
fof(f1197,plain,
( ! [X0] :
( sK3 != app(X0,sK3)
| ~ ssList(X0) )
| ~ spl17_20 ),
inference(avatar_component_clause,[],[f1196]) ).
fof(f1196,plain,
( spl17_20
<=> ! [X0] :
( ~ ssList(X0)
| sK3 != app(X0,sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_20])]) ).
fof(f1207,plain,
( spl17_20
| spl17_22 ),
inference(avatar_split_clause,[],[f1203,f1205,f1196]) ).
fof(f1203,plain,
! [X0,X1] :
( segmentP(app(sK2,X1),sK2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(sK2,X1))
| sK3 != app(X0,sK3) ),
inference(subsumption_resolution,[],[f1137,f182]) ).
fof(f182,plain,
ssList(sK2),
inference(cnf_transformation,[],[f151]) ).
fof(f1137,plain,
! [X0,X1] :
( segmentP(app(sK2,X1),sK2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(sK2)
| ~ ssList(app(sK2,X1))
| sK3 != app(X0,sK3) ),
inference(duplicate_literal_removal,[],[f1130]) ).
fof(f1130,plain,
! [X0,X1] :
( segmentP(app(sK2,X1),sK2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(sK2)
| ~ ssList(app(sK2,X1))
| sK3 != app(X0,sK3)
| ~ ssList(X0) ),
inference(superposition,[],[f263,f1086]) ).
fof(f1086,plain,
! [X0] :
( sK2 = app(X0,sK2)
| sK3 != app(X0,sK3)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f1075,f182]) ).
fof(f1075,plain,
! [X0] :
( sK3 != app(X0,sK3)
| sK2 = app(X0,sK2)
| ~ ssList(sK2)
| ~ ssList(X0) ),
inference(superposition,[],[f404,f188]) ).
fof(f404,plain,
! [X0,X1] :
( sK3 != app(X0,app(X1,sK4))
| app(X0,X1) = sK2
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f403,f214]) ).
fof(f214,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,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.WVEenmXwtH/Vampire---4.8_10832',ax26) ).
fof(f403,plain,
! [X0,X1] :
( sK3 != app(X0,app(X1,sK4))
| app(X0,X1) = sK2
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f399,f187]) ).
fof(f399,plain,
! [X0,X1] :
( sK3 != app(X0,app(X1,sK4))
| app(X0,X1) = sK2
| ~ ssList(app(X0,X1))
| ~ ssList(sK4)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f360,f208]) ).
fof(f208,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WVEenmXwtH/Vampire---4.8_10832',ax82) ).
fof(f360,plain,
! [X0] :
( sK3 != app(X0,sK4)
| sK2 = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f359,f187]) ).
fof(f359,plain,
! [X0] :
( sK3 != app(X0,sK4)
| sK2 = X0
| ~ ssList(sK4)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f348,f182]) ).
fof(f348,plain,
! [X0] :
( sK3 != app(X0,sK4)
| sK2 = X0
| ~ ssList(sK2)
| ~ ssList(sK4)
| ~ ssList(X0) ),
inference(superposition,[],[f211,f188]) ).
fof(f211,plain,
! [X2,X0,X1] :
( app(X2,X1) != app(X0,X1)
| X0 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X0 = X2
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X0 = X2
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,X1) = app(X0,X1)
=> X0 = X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WVEenmXwtH/Vampire---4.8_10832',ax79) ).
fof(f263,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f230]) ).
fof(f230,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f164,f166,f165]) ).
fof(f165,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f129,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.WVEenmXwtH/Vampire---4.8_10832',ax7) ).
fof(f339,plain,
~ spl17_3,
inference(avatar_contradiction_clause,[],[f338]) ).
fof(f338,plain,
( $false
| ~ spl17_3 ),
inference(subsumption_resolution,[],[f336,f219]) ).
fof(f336,plain,
( ~ ssList(nil)
| ~ spl17_3 ),
inference(resolution,[],[f308,f268]) ).
fof(f268,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f260]) ).
fof(f260,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f215]) ).
fof(f215,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f118,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.WVEenmXwtH/Vampire---4.8_10832',ax15) ).
fof(f308,plain,
( neq(nil,nil)
| ~ spl17_3 ),
inference(superposition,[],[f255,f282]) ).
fof(f282,plain,
( nil = sK3
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f280,plain,
( spl17_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_3])]) ).
fof(f255,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f186,f184]) ).
fof(f184,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f151]) ).
fof(f186,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f151]) ).
fof(f306,plain,
( spl17_4
| spl17_1 ),
inference(avatar_split_clause,[],[f305,f271,f284]) ).
fof(f284,plain,
( spl17_4
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f271,plain,
( spl17_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_1])]) ).
fof(f305,plain,
( nil = sK2
| spl17_1 ),
inference(subsumption_resolution,[],[f304,f182]) ).
fof(f304,plain,
( nil = sK2
| ~ ssList(sK2)
| spl17_1 ),
inference(subsumption_resolution,[],[f289,f219]) ).
fof(f289,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl17_1 ),
inference(resolution,[],[f273,f216]) ).
fof(f216,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f273,plain,
( ~ neq(sK2,nil)
| spl17_1 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f287,plain,
( spl17_3
| ~ spl17_4 ),
inference(avatar_split_clause,[],[f191,f284,f280]) ).
fof(f191,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f151]) ).
fof(f278,plain,
( ~ spl17_1
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f254,f275,f271]) ).
fof(f254,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f192,f184,f185,f185]) ).
fof(f185,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f151]) ).
fof(f192,plain,
( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC124+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/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.16/0.36 % Computer : n021.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:24:11 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.WVEenmXwtH/Vampire---4.8_10832
% 0.62/0.82 % (11037)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 (2995ds/34Mi)
% 0.62/0.82 % (11043)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 (2995ds/83Mi)
% 0.62/0.82 % (11038)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 (2995ds/51Mi)
% 0.62/0.82 % (11039)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.82 % (11042)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.82 % (11041)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 (2995ds/34Mi)
% 0.62/0.82 % (11040)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.82 % (11044)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 (2995ds/56Mi)
% 0.67/0.84 % (11041)Instruction limit reached!
% 0.67/0.84 % (11041)------------------------------
% 0.67/0.84 % (11041)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.67/0.84 % (11041)Termination reason: Unknown
% 0.67/0.84 % (11041)Termination phase: Saturation
% 0.67/0.84
% 0.67/0.84 % (11041)Memory used [KB]: 1880
% 0.67/0.84 % (11041)Time elapsed: 0.019 s
% 0.67/0.84 % (11041)Instructions burned: 34 (million)
% 0.67/0.84 % (11041)------------------------------
% 0.67/0.84 % (11041)------------------------------
% 0.67/0.84 % (11040)Instruction limit reached!
% 0.67/0.84 % (11040)------------------------------
% 0.67/0.84 % (11040)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.67/0.84 % (11040)Termination reason: Unknown
% 0.67/0.84 % (11040)Termination phase: Saturation
% 0.67/0.84
% 0.67/0.84 % (11040)Memory used [KB]: 1460
% 0.67/0.84 % (11040)Time elapsed: 0.020 s
% 0.67/0.84 % (11040)Instructions burned: 33 (million)
% 0.67/0.84 % (11040)------------------------------
% 0.67/0.84 % (11040)------------------------------
% 0.67/0.84 % (11037)Instruction limit reached!
% 0.67/0.84 % (11037)------------------------------
% 0.67/0.84 % (11037)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.67/0.84 % (11037)Termination reason: Unknown
% 0.67/0.84 % (11037)Termination phase: Saturation
% 0.67/0.84
% 0.67/0.84 % (11037)Memory used [KB]: 1436
% 0.67/0.84 % (11037)Time elapsed: 0.022 s
% 0.67/0.84 % (11037)Instructions burned: 35 (million)
% 0.67/0.84 % (11037)------------------------------
% 0.67/0.84 % (11037)------------------------------
% 0.67/0.84 % (11049)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 (2995ds/55Mi)
% 0.67/0.84 % (11050)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 (2995ds/50Mi)
% 0.67/0.84 % (11051)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 (2995ds/208Mi)
% 0.67/0.85 % (11042)First to succeed.
% 0.67/0.85 % (11043)Also succeeded, but the first one will report.
% 0.67/0.85 % (11042)Refutation found. Thanks to Tanya!
% 0.67/0.85 % SZS status Theorem for Vampire---4
% 0.67/0.85 % SZS output start Proof for Vampire---4
% See solution above
% 0.67/0.85 % (11042)------------------------------
% 0.67/0.85 % (11042)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.67/0.85 % (11042)Termination reason: Refutation
% 0.67/0.85
% 0.67/0.85 % (11042)Memory used [KB]: 1481
% 0.67/0.85 % (11042)Time elapsed: 0.029 s
% 0.67/0.85 % (11042)Instructions burned: 47 (million)
% 0.67/0.85 % (11042)------------------------------
% 0.67/0.85 % (11042)------------------------------
% 0.67/0.85 % (11004)Success in time 0.474 s
% 0.67/0.85 % Vampire---4.8 exiting
%------------------------------------------------------------------------------