TSTP Solution File: SWC031+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC031+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:18 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 23
% Syntax : Number of formulae : 127 ( 8 unt; 0 def)
% Number of atoms : 702 ( 176 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 964 ( 389 ~; 380 |; 148 &)
% ( 9 <=>; 38 =>; 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 : 194 ( 158 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f802,plain,
$false,
inference(avatar_sat_refutation,[],[f388,f389,f407,f778,f799]) ).
fof(f799,plain,
( spl23_2
| spl23_3 ),
inference(avatar_contradiction_clause,[],[f798]) ).
fof(f798,plain,
( $false
| spl23_2
| spl23_3 ),
inference(subsumption_resolution,[],[f797,f239]) ).
fof(f239,plain,
ssList(sK3),
inference(cnf_transformation,[],[f186]) ).
fof(f186,plain,
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(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])],[f99,f185,f184,f183,f182]) ).
fof(f182,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f183,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f184,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f185,plain,
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& 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)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(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 = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',co1) ).
fof(f797,plain,
( ~ ssList(sK3)
| spl23_2
| spl23_3 ),
inference(subsumption_resolution,[],[f795,f387]) ).
fof(f387,plain,
( nil != sK3
| spl23_2 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f385,plain,
( spl23_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_2])]) ).
fof(f795,plain,
( nil = sK3
| ~ ssList(sK3)
| spl23_3 ),
inference(resolution,[],[f770,f298]) ).
fof(f298,plain,
! [X0] :
( ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f217,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])],[f129,f216,f215]) ).
fof(f215,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(f216,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK14(X0)) = X0
& ssItem(X2) )
=> ( cons(sK15(X0),sK14(X0)) = X0
& ssItem(sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f128,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax20) ).
fof(f770,plain,
( ~ ssItem(sK15(sK3))
| spl23_3 ),
inference(avatar_component_clause,[],[f768]) ).
fof(f768,plain,
( spl23_3
<=> ssItem(sK15(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_3])]) ).
fof(f778,plain,
( ~ spl23_3
| ~ spl23_1
| spl23_2 ),
inference(avatar_split_clause,[],[f777,f385,f381,f768]) ).
fof(f381,plain,
( spl23_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f777,plain,
( ~ ssItem(sK15(sK3))
| ~ spl23_1
| spl23_2 ),
inference(subsumption_resolution,[],[f763,f253]) ).
fof(f253,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax17) ).
fof(f763,plain,
( ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| ~ spl23_1
| spl23_2 ),
inference(trivial_inequality_removal,[],[f757]) ).
fof(f757,plain,
( nil != nil
| ~ ssItem(sK15(sK3))
| ~ ssList(nil)
| ~ spl23_1
| spl23_2 ),
inference(superposition,[],[f302,f730]) ).
fof(f730,plain,
( nil = cons(sK15(sK3),nil)
| ~ spl23_1
| spl23_2 ),
inference(subsumption_resolution,[],[f729,f239]) ).
fof(f729,plain,
( nil = cons(sK15(sK3),nil)
| ~ ssList(sK3)
| ~ spl23_1
| spl23_2 ),
inference(subsumption_resolution,[],[f728,f387]) ).
fof(f728,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f725]) ).
fof(f725,plain,
( nil = cons(sK15(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(sK3)
| ~ spl23_1 ),
inference(resolution,[],[f702,f261]) ).
fof(f261,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax42) ).
fof(f702,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| nil = X0
| ~ ssList(X0) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f701,f298]) ).
fof(f701,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f696,f297]) ).
fof(f297,plain,
! [X0] :
( ssList(sK14(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f696,plain,
( ! [X0] :
( ~ frontsegP(sK3,X0)
| ~ ssList(sK14(X0))
| nil = cons(sK15(X0),nil)
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl23_1 ),
inference(superposition,[],[f677,f299]) ).
fof(f299,plain,
! [X0] :
( cons(sK15(X0),sK14(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f677,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) )
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f675]) ).
fof(f675,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,cons(X0,X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl23_1 ),
inference(superposition,[],[f657,f309]) ).
fof(f309,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax81) ).
fof(f657,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssList(X1)
| nil = cons(X0,nil)
| ~ ssItem(X0) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f656,f253]) ).
fof(f656,plain,
( ! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f655]) ).
fof(f655,plain,
( ! [X0,X1] :
( nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl23_1 ),
inference(resolution,[],[f653,f303]) ).
fof(f303,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax16) ).
fof(f653,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssList(X1)
| ~ frontsegP(sK3,app(cons(X0,nil),X1))
| ~ ssItem(X0) )
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f649]) ).
fof(f649,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_1 ),
inference(resolution,[],[f648,f261]) ).
fof(f648,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_1 ),
inference(subsumption_resolution,[],[f647,f253]) ).
fof(f647,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_1 ),
inference(duplicate_literal_removal,[],[f646]) ).
fof(f646,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_1 ),
inference(resolution,[],[f619,f303]) ).
fof(f619,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_1 ),
inference(subsumption_resolution,[],[f616,f314]) ).
fof(f314,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax26) ).
fof(f616,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_1 ),
inference(resolution,[],[f601,f260]) ).
fof(f260,plain,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f105,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax43) ).
fof(f601,plain,
( ! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f600,f253]) ).
fof(f600,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(nil) )
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f599]) ).
fof(f599,plain,
( ! [X0,X1] :
( ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(nil) )
| ~ spl23_1 ),
inference(resolution,[],[f585,f303]) ).
fof(f585,plain,
( ! [X0,X1] :
( ~ ssList(cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ frontsegP(X0,cons(X1,nil))
| ~ ssList(X0)
| nil = cons(X1,nil)
| ~ ssItem(X1) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f582,f239]) ).
fof(f582,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_1 ),
inference(duplicate_literal_removal,[],[f575]) ).
fof(f575,plain,
( ! [X0,X1] :
( ~ frontsegP(X0,cons(X1,nil))
| ~ frontsegP(sK3,X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(sK3)
| nil = cons(X1,nil)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) )
| ~ spl23_1 ),
inference(resolution,[],[f263,f430]) ).
fof(f430,plain,
( ! [X0] :
( ~ frontsegP(sK3,cons(X0,nil))
| nil = cons(X0,nil)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl23_1 ),
inference(resolution,[],[f429,f392]) ).
fof(f392,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f366,f253]) ).
fof(f366,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f281]) ).
fof(f281,plain,
! [X0,X1] :
( totalorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f202]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax67) ).
fof(f429,plain,
( ! [X0] :
( ~ totalorderedP(X0)
| ~ ssList(X0)
| nil = X0
| ~ frontsegP(sK3,X0) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f426,f253]) ).
fof(f426,plain,
( ! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(nil)
| ~ totalorderedP(X0)
| ~ frontsegP(sK3,X0) )
| ~ spl23_1 ),
inference(duplicate_literal_removal,[],[f425]) ).
fof(f425,plain,
( ! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(nil)
| ~ totalorderedP(X0)
| ~ frontsegP(sK3,X0)
| ~ ssList(X0) )
| ~ spl23_1 ),
inference(resolution,[],[f250,f413]) ).
fof(f413,plain,
( ! [X4] :
( ~ neq(nil,X4)
| ~ totalorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) )
| ~ spl23_1 ),
inference(subsumption_resolution,[],[f412,f269]) ).
fof(f269,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax57) ).
fof(f412,plain,
( ! [X4] :
( ~ segmentP(X4,nil)
| ~ neq(nil,X4)
| ~ totalorderedP(X4)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) )
| ~ spl23_1 ),
inference(forward_demodulation,[],[f409,f382]) ).
fof(f382,plain,
( nil = sK2
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f409,plain,
( ! [X4] :
( ~ neq(nil,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ ssList(X4) )
| ~ spl23_1 ),
inference(backward_demodulation,[],[f244,f382]) ).
fof(f244,plain,
! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f186]) ).
fof(f250,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f187]) ).
fof(f187,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax15) ).
fof(f263,plain,
! [X2,X0,X1] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f110,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax40) ).
fof(f302,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,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/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax18) ).
fof(f407,plain,
( spl23_1
| ~ spl23_2 ),
inference(avatar_contradiction_clause,[],[f406]) ).
fof(f406,plain,
( $false
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f405,f238]) ).
fof(f238,plain,
ssList(sK2),
inference(cnf_transformation,[],[f186]) ).
fof(f405,plain,
( ~ ssList(sK2)
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f399,f383]) ).
fof(f383,plain,
( nil != sK2
| spl23_1 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f399,plain,
( nil = sK2
| ~ ssList(sK2)
| ~ spl23_2 ),
inference(resolution,[],[f254,f395]) ).
fof(f395,plain,
( frontsegP(nil,sK2)
| ~ spl23_2 ),
inference(backward_demodulation,[],[f242,f386]) ).
fof(f386,plain,
( nil = sK3
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f242,plain,
frontsegP(sK3,sK2),
inference(cnf_transformation,[],[f186]) ).
fof(f254,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f189]) ).
fof(f189,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760',ax46) ).
fof(f389,plain,
( spl23_2
| spl23_1 ),
inference(avatar_split_clause,[],[f356,f381,f385]) ).
fof(f356,plain,
( nil = sK2
| nil = sK3 ),
inference(definition_unfolding,[],[f245,f241,f240]) ).
fof(f240,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f186]) ).
fof(f241,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f186]) ).
fof(f245,plain,
( nil = sK0
| nil = sK1 ),
inference(cnf_transformation,[],[f186]) ).
fof(f388,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f353,f385,f381]) ).
fof(f353,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f248,f240,f241]) ).
fof(f248,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC031+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:11:03 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.2gL2jcdDiK/Vampire---4.8_31760
% 0.61/0.76 % (32018)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.61/0.76 % (32021)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.61/0.76 % (32020)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.61/0.76 % (32019)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.61/0.76 % (32025)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.61/0.76 % (32024)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.61/0.76 % (32023)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.61/0.76 % (32022)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.61/0.77 % (32021)Instruction limit reached!
% 0.61/0.77 % (32021)------------------------------
% 0.61/0.77 % (32021)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (32022)Instruction limit reached!
% 0.61/0.77 % (32022)------------------------------
% 0.61/0.77 % (32022)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (32022)Termination reason: Unknown
% 0.61/0.77 % (32022)Termination phase: Saturation
% 0.61/0.77
% 0.61/0.77 % (32022)Memory used [KB]: 1969
% 0.61/0.77 % (32022)Time elapsed: 0.012 s
% 0.61/0.77 % (32022)Instructions burned: 34 (million)
% 0.61/0.77 % (32022)------------------------------
% 0.61/0.77 % (32022)------------------------------
% 0.61/0.77 % (32021)Termination reason: Unknown
% 0.61/0.77 % (32021)Termination phase: Saturation
% 0.61/0.77
% 0.61/0.77 % (32021)Memory used [KB]: 1798
% 0.61/0.77 % (32021)Time elapsed: 0.019 s
% 0.61/0.77 % (32021)Instructions burned: 33 (million)
% 0.61/0.77 % (32021)------------------------------
% 0.61/0.77 % (32021)------------------------------
% 0.61/0.77 % (32018)Instruction limit reached!
% 0.61/0.77 % (32018)------------------------------
% 0.61/0.77 % (32018)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (32018)Termination reason: Unknown
% 0.61/0.77 % (32018)Termination phase: Saturation
% 0.61/0.77
% 0.61/0.77 % (32018)Memory used [KB]: 1487
% 0.61/0.77 % (32018)Time elapsed: 0.021 s
% 0.61/0.77 % (32018)Instructions burned: 34 (million)
% 0.61/0.77 % (32018)------------------------------
% 0.61/0.77 % (32018)------------------------------
% 0.61/0.78 % (32020)First to succeed.
% 0.61/0.78 % (32026)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 % (32027)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 % (32028)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 % (32020)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (32020)------------------------------
% 0.61/0.78 % (32020)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (32020)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (32020)Memory used [KB]: 1410
% 0.61/0.78 % (32020)Time elapsed: 0.024 s
% 0.61/0.78 % (32020)Instructions burned: 40 (million)
% 0.61/0.78 % (32020)------------------------------
% 0.61/0.78 % (32020)------------------------------
% 0.61/0.78 % (32014)Success in time 0.393 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------