TSTP Solution File: SWC021+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC021+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 : n022.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:37 EDT 2024
% Result : Theorem 0.53s 0.75s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 43
% Number of leaves : 22
% Syntax : Number of formulae : 124 ( 11 unt; 0 def)
% Number of atoms : 734 ( 145 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 1049 ( 439 ~; 412 |; 150 &)
% ( 7 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 211 ( 171 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f811,plain,
$false,
inference(avatar_sat_refutation,[],[f385,f418,f785,f808]) ).
fof(f808,plain,
( spl23_1
| spl23_3 ),
inference(avatar_contradiction_clause,[],[f807]) ).
fof(f807,plain,
( $false
| spl23_1
| spl23_3 ),
inference(subsumption_resolution,[],[f806,f240]) ).
fof(f240,plain,
ssList(sK3),
inference(cnf_transformation,[],[f187]) ).
fof(f187,plain,
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f186,f185,f184,f183]) ).
fof(f183,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f185,plain,
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& strictorderedP(X2)
& frontsegP(X3,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] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X2)
& frontsegP(X3,X5)
& neq(X2,X5)
& ssList(X5) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X2)
& frontsegP(X3,X5)
& neq(X2,X5)
& ssList(X5) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f806,plain,
( ~ ssList(sK3)
| spl23_1
| spl23_3 ),
inference(subsumption_resolution,[],[f804,f380]) ).
fof(f380,plain,
( nil != sK3
| spl23_1 ),
inference(avatar_component_clause,[],[f378]) ).
fof(f378,plain,
( spl23_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f804,plain,
( nil = sK3
| ~ ssList(sK3)
| spl23_3 ),
inference(resolution,[],[f777,f297]) ).
fof(f297,plain,
! [X0] :
( ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f218]) ).
fof(f218,plain,
! [X0] :
( ( cons(sK15(X0),sK14(X0)) = X0
& ssItem(sK15(X0))
& ssList(sK14(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f130,f217,f216]) ).
fof(f216,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK14(X0)) = X0
& ssItem(X2) )
& ssList(sK14(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f217,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK14(X0)) = X0
& ssItem(X2) )
=> ( cons(sK15(X0),sK14(X0)) = X0
& ssItem(sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f777,plain,
( ~ ssItem(sK15(sK3))
| spl23_3 ),
inference(avatar_component_clause,[],[f775]) ).
fof(f775,plain,
( spl23_3
<=> ssItem(sK15(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_3])]) ).
fof(f785,plain,
( ~ spl23_3
| spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f784,f382,f378,f775]) ).
fof(f382,plain,
( spl23_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_2])]) ).
fof(f784,plain,
( ~ ssItem(sK15(sK3))
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f770,f252]) ).
fof(f252,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f770,plain,
( ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| spl23_1
| ~ spl23_2 ),
inference(trivial_inequality_removal,[],[f765]) ).
fof(f765,plain,
( nil != nil
| ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| spl23_1
| ~ spl23_2 ),
inference(superposition,[],[f301,f737]) ).
fof(f737,plain,
( nil = cons(sK15(sK3),nil)
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f736,f240]) ).
fof(f736,plain,
( nil = cons(sK15(sK3),nil)
| ~ ssList(sK3)
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f735,f380]) ).
fof(f735,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f732]) ).
fof(f732,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(sK3)
| ~ spl23_2 ),
inference(resolution,[],[f709,f260]) ).
fof(f260,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f709,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| nil = X0
| ~ ssList(X0) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f708,f297]) ).
fof(f708,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f703,f296]) ).
fof(f296,plain,
! [X0] :
( ssList(sK14(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f218]) ).
fof(f703,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| ~ ssList(sK14(X0))
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl23_2 ),
inference(superposition,[],[f684,f298]) ).
fof(f298,plain,
! [X0] :
( cons(sK15(X0),sK14(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f218]) ).
fof(f684,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f682]) ).
fof(f682,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl23_2 ),
inference(superposition,[],[f664,f308]) ).
fof(f308,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f664,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f663,f252]) ).
fof(f663,plain,
( ! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f662]) ).
fof(f662,plain,
( ! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(resolution,[],[f655,f302]) ).
fof(f302,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f655,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f651]) ).
fof(f651,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil)) )
| ~ spl23_2 ),
inference(resolution,[],[f650,f260]) ).
fof(f650,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(X1,cons(X0,nil))
| ~ ssItem(X0)
| nil = cons(X0,nil)
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f649,f252]) ).
fof(f649,plain,
( ! [X2,X0,X1] :
( nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ frontsegP(X1,cons(X0,nil))
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f648]) ).
fof(f648,plain,
( ! [X2,X0,X1] :
( nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ frontsegP(X1,cons(X0,nil))
| ~ ssList(X2)
| ~ frontsegP(sK3,app(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(resolution,[],[f628,f302]) ).
fof(f628,plain,
( ! [X2,X0,X1] :
( ~ ssList(cons(X2,nil))
| nil = cons(X2,nil)
| ~ ssItem(X2)
| ~ frontsegP(X0,cons(X2,nil))
| ~ ssList(X1)
| ~ frontsegP(sK3,app(X0,X1))
| ~ ssList(X0) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f625,f313]) ).
fof(f313,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,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(f625,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(sK3,app(X0,X1))
| ~ ssList(app(X0,X1))
| nil = cons(X2,nil)
| ~ ssItem(X2)
| ~ frontsegP(X0,cons(X2,nil))
| ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| ~ ssList(X0) )
| ~ spl23_2 ),
inference(resolution,[],[f608,f259]) ).
fof(f259,plain,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X0,X1)
=> frontsegP(app(X0,X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax43) ).
fof(f608,plain,
( ! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f607,f252]) ).
fof(f607,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f606]) ).
fof(f606,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(resolution,[],[f592,f302]) ).
fof(f592,plain,
( ! [X0,X1] :
( ~ ssList(cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f589,f240]) ).
fof(f589,plain,
( ! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(sK3)
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f582]) ).
fof(f582,plain,
( ! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(sK3)
| ~ ssList(cons(X1,nil))
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_2 ),
inference(resolution,[],[f262,f434]) ).
fof(f434,plain,
( ! [X0] :
( ~ frontsegP(sK3,cons(X0,nil))
| ~ ssList(cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssItem(X0) )
| ~ spl23_2 ),
inference(resolution,[],[f429,f388]) ).
fof(f388,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f363,f252]) ).
fof(f363,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f280]) ).
fof(f280,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f204]) ).
fof(f204,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f203]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(f429,plain,
( ! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0 )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f428,f252]) ).
fof(f428,plain,
( ! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(duplicate_literal_removal,[],[f427]) ).
fof(f427,plain,
( ! [X0] :
( ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl23_2 ),
inference(resolution,[],[f426,f249]) ).
fof(f249,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f188,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(f426,plain,
( ! [X4] :
( ~ neq(nil,X4)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) )
| ~ spl23_2 ),
inference(forward_demodulation,[],[f425,f383]) ).
fof(f383,plain,
( nil = sK2
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f382]) ).
fof(f425,plain,
( ! [X4] :
( ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f422,f268]) ).
fof(f268,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f422,plain,
( ! [X4] :
( ~ segmentP(X4,nil)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
| ~ spl23_2 ),
inference(backward_demodulation,[],[f246,f383]) ).
fof(f246,plain,
! [X4] :
( ~ segmentP(X4,sK2)
| ~ strictorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f187]) ).
fof(f262,plain,
! [X2,X0,X1] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f40,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X0,X1) )
=> frontsegP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f301,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f418,plain,
spl23_2,
inference(avatar_split_clause,[],[f417,f382]) ).
fof(f417,plain,
nil = sK2,
inference(subsumption_resolution,[],[f416,f239]) ).
fof(f239,plain,
ssList(sK2),
inference(cnf_transformation,[],[f187]) ).
fof(f416,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f411,f252]) ).
fof(f411,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f249,f394]) ).
fof(f394,plain,
~ neq(sK2,nil),
inference(subsumption_resolution,[],[f393,f243]) ).
fof(f243,plain,
frontsegP(sK3,sK2),
inference(cnf_transformation,[],[f187]) ).
fof(f393,plain,
( ~ frontsegP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(subsumption_resolution,[],[f392,f239]) ).
fof(f392,plain,
( ~ ssList(sK2)
| ~ frontsegP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(duplicate_literal_removal,[],[f391]) ).
fof(f391,plain,
( ~ ssList(sK2)
| ~ frontsegP(sK3,sK2)
| ~ neq(sK2,nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f260,f353]) ).
fof(f353,plain,
! [X5] :
( ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f245,f242,f241]) ).
fof(f241,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f187]) ).
fof(f242,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f187]) ).
fof(f245,plain,
! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f187]) ).
fof(f385,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f352,f382,f378]) ).
fof(f352,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f247,f242,f241]) ).
fof(f247,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f187]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC021+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % 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.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:22:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.73 % (24989)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.53/0.73 % (24983)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.53/0.73 % (24985)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73 % (24986)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.53/0.73 % (24987)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.53/0.73 % (24984)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.53/0.73 % (24988)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.53/0.74 % (24990)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.53/0.75 % (24986)Instruction limit reached!
% 0.53/0.75 % (24986)------------------------------
% 0.53/0.75 % (24986)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (24986)Termination reason: Unknown
% 0.53/0.75 % (24986)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (24986)Memory used [KB]: 1986
% 0.53/0.75 % (24986)Time elapsed: 0.019 s
% 0.53/0.75 % (24986)Instructions burned: 33 (million)
% 0.53/0.75 % (24986)------------------------------
% 0.53/0.75 % (24986)------------------------------
% 0.53/0.75 % (24983)Instruction limit reached!
% 0.53/0.75 % (24983)------------------------------
% 0.53/0.75 % (24983)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (24983)Termination reason: Unknown
% 0.53/0.75 % (24983)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (24983)Memory used [KB]: 1474
% 0.53/0.75 % (24983)Time elapsed: 0.021 s
% 0.53/0.75 % (24983)Instructions burned: 34 (million)
% 0.53/0.75 % (24983)------------------------------
% 0.53/0.75 % (24983)------------------------------
% 0.53/0.75 % (24985)First to succeed.
% 0.53/0.75 % (24991)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.53/0.75 % (24988)Instruction limit reached!
% 0.53/0.75 % (24988)------------------------------
% 0.53/0.75 % (24988)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (24988)Termination reason: Unknown
% 0.53/0.75 % (24988)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (24988)Memory used [KB]: 1587
% 0.53/0.75 % (24989)Instruction limit reached!
% 0.53/0.75 % (24989)------------------------------
% 0.53/0.75 % (24989)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (24989)Termination reason: Unknown
% 0.53/0.75 % (24989)Termination phase: Saturation
% 0.53/0.75
% 0.53/0.75 % (24989)Memory used [KB]: 2188
% 0.53/0.75 % (24989)Time elapsed: 0.025 s
% 0.53/0.75 % (24989)Instructions burned: 84 (million)
% 0.53/0.75 % (24989)------------------------------
% 0.53/0.75 % (24989)------------------------------
% 0.53/0.75 % (24988)Time elapsed: 0.024 s
% 0.53/0.75 % (24988)Instructions burned: 47 (million)
% 0.53/0.75 % (24988)------------------------------
% 0.53/0.75 % (24988)------------------------------
% 0.53/0.75 % (24985)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24982"
% 0.53/0.75 % (24985)Refutation found. Thanks to Tanya!
% 0.53/0.75 % SZS status Theorem for theBenchmark
% 0.53/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.75 % (24985)------------------------------
% 0.53/0.75 % (24985)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (24985)Termination reason: Refutation
% 0.53/0.75
% 0.53/0.75 % (24985)Memory used [KB]: 1421
% 0.53/0.75 % (24985)Time elapsed: 0.024 s
% 0.53/0.75 % (24985)Instructions burned: 40 (million)
% 0.53/0.75 % (24982)Success in time 0.391 s
% 0.53/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------