TSTP Solution File: SWC071+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC071+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 : n027.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 : Sun May 5 09:48:22 EDT 2024
% Result : Theorem 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of formulae : 108 ( 8 unt; 0 def)
% Number of atoms : 653 ( 165 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 861 ( 316 ~; 278 |; 218 &)
% ( 12 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 9 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 205 ( 128 !; 77 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1033,plain,
$false,
inference(avatar_sat_refutation,[],[f294,f299,f300,f700,f758,f763,f791,f814,f843,f1032]) ).
fof(f1032,plain,
( ~ spl16_1
| ~ spl16_2 ),
inference(avatar_contradiction_clause,[],[f1031]) ).
fof(f1031,plain,
( $false
| ~ spl16_1
| ~ spl16_2 ),
inference(subsumption_resolution,[],[f1030,f859]) ).
fof(f859,plain,
( sP0(sK7,nil)
| ~ spl16_1
| ~ spl16_2 ),
inference(backward_demodulation,[],[f289,f293]) ).
fof(f293,plain,
( nil = sK6
| ~ spl16_2 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f291,plain,
( spl16_2
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).
fof(f289,plain,
( sP0(sK7,sK6)
| ~ spl16_1 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f287,plain,
( spl16_1
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).
fof(f1030,plain,
( ~ sP0(sK7,nil)
| ~ spl16_1
| ~ spl16_2 ),
inference(resolution,[],[f923,f191]) ).
fof(f191,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f153,f156,f155,f154]) ).
fof(f154,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f152]) ).
fof(f152,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f923,plain,
( ~ ssItem(sK1(sK7,nil))
| ~ spl16_1
| ~ spl16_2 ),
inference(forward_demodulation,[],[f922,f293]) ).
fof(f922,plain,
( ~ ssItem(sK1(sK7,sK6))
| ~ spl16_1
| ~ spl16_2 ),
inference(subsumption_resolution,[],[f921,f234]) ).
fof(f234,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.JqVdetbkRY/Vampire---4.8_15955',ax17) ).
fof(f921,plain,
( ~ ssItem(sK1(sK7,sK6))
| ~ ssList(nil)
| ~ spl16_1
| ~ spl16_2 ),
inference(subsumption_resolution,[],[f326,f293]) ).
fof(f326,plain,
( nil != sK6
| ~ ssItem(sK1(sK7,sK6))
| ~ ssList(nil)
| ~ spl16_1 ),
inference(superposition,[],[f217,f324]) ).
fof(f324,plain,
( sK6 = cons(sK1(sK7,sK6),nil)
| ~ spl16_1 ),
inference(resolution,[],[f194,f289]) ).
fof(f194,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f157]) ).
fof(f217,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,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.JqVdetbkRY/Vampire---4.8_15955',ax18) ).
fof(f843,plain,
spl16_27,
inference(avatar_contradiction_clause,[],[f842]) ).
fof(f842,plain,
( $false
| spl16_27 ),
inference(subsumption_resolution,[],[f839,f200]) ).
fof(f200,plain,
ssList(sK6),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f158,f162,f161,f160,f159]) ).
fof(f159,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != sK4
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != sK4
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ( nil != sK4
| nil != sK5 )
& ! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f151]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ( nil != X0
| nil != X1 )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f150]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X9] :
( ~ segmentP(X0,X9)
| ~ segmentP(X1,X9)
| ~ neq(X9,nil)
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| ( nil = X0
& nil = X1 )
| ? [X9] :
( segmentP(X0,X9)
& segmentP(X1,X9)
& neq(X9,nil)
& ssList(X9) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X2),X7) != X3
| cons(X5,nil) != X2 ) ) ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X2),X7) != X3
| cons(X5,nil) != X2 ) ) ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JqVdetbkRY/Vampire---4.8_15955',co1) ).
fof(f839,plain,
( ~ ssList(sK6)
| spl16_27 ),
inference(resolution,[],[f790,f250]) ).
fof(f250,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.JqVdetbkRY/Vampire---4.8_15955',ax55) ).
fof(f790,plain,
( ~ segmentP(sK6,sK6)
| spl16_27 ),
inference(avatar_component_clause,[],[f788]) ).
fof(f788,plain,
( spl16_27
<=> segmentP(sK6,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_27])]) ).
fof(f814,plain,
( spl16_2
| spl16_26 ),
inference(avatar_contradiction_clause,[],[f813]) ).
fof(f813,plain,
( $false
| spl16_2
| spl16_26 ),
inference(subsumption_resolution,[],[f812,f200]) ).
fof(f812,plain,
( ~ ssList(sK6)
| spl16_2
| spl16_26 ),
inference(subsumption_resolution,[],[f811,f234]) ).
fof(f811,plain,
( ~ ssList(nil)
| ~ ssList(sK6)
| spl16_2
| spl16_26 ),
inference(subsumption_resolution,[],[f810,f292]) ).
fof(f292,plain,
( nil != sK6
| spl16_2 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f810,plain,
( nil = sK6
| ~ ssList(nil)
| ~ ssList(sK6)
| spl16_26 ),
inference(resolution,[],[f786,f231]) ).
fof(f231,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,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.JqVdetbkRY/Vampire---4.8_15955',ax15) ).
fof(f786,plain,
( ~ neq(sK6,nil)
| spl16_26 ),
inference(avatar_component_clause,[],[f784]) ).
fof(f784,plain,
( spl16_26
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_26])]) ).
fof(f791,plain,
( ~ spl16_26
| ~ spl16_27
| ~ spl16_24 ),
inference(avatar_split_clause,[],[f782,f751,f788,f784]) ).
fof(f751,plain,
( spl16_24
<=> segmentP(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_24])]) ).
fof(f782,plain,
( ~ segmentP(sK6,sK6)
| ~ neq(sK6,nil)
| ~ spl16_24 ),
inference(subsumption_resolution,[],[f778,f200]) ).
fof(f778,plain,
( ~ segmentP(sK6,sK6)
| ~ neq(sK6,nil)
| ~ ssList(sK6)
| ~ spl16_24 ),
inference(resolution,[],[f753,f269]) ).
fof(f269,plain,
! [X4] :
( ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f204,f203,f202]) ).
fof(f202,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f163]) ).
fof(f203,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f163]) ).
fof(f204,plain,
! [X4] :
( ~ segmentP(sK4,X4)
| ~ segmentP(sK5,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f163]) ).
fof(f753,plain,
( segmentP(sK7,sK6)
| ~ spl16_24 ),
inference(avatar_component_clause,[],[f751]) ).
fof(f763,plain,
( ~ spl16_1
| spl16_25 ),
inference(avatar_contradiction_clause,[],[f762]) ).
fof(f762,plain,
( $false
| ~ spl16_1
| spl16_25 ),
inference(subsumption_resolution,[],[f761,f289]) ).
fof(f761,plain,
( ~ sP0(sK7,sK6)
| spl16_25 ),
inference(resolution,[],[f757,f192]) ).
fof(f192,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f757,plain,
( ~ ssList(sK2(sK7,sK6))
| spl16_25 ),
inference(avatar_component_clause,[],[f755]) ).
fof(f755,plain,
( spl16_25
<=> ssList(sK2(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_25])]) ).
fof(f758,plain,
( spl16_24
| ~ spl16_25
| ~ spl16_1
| ~ spl16_19 ),
inference(avatar_split_clause,[],[f749,f647,f287,f755,f751]) ).
fof(f647,plain,
( spl16_19
<=> ssList(sK3(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_19])]) ).
fof(f749,plain,
( ~ ssList(sK2(sK7,sK6))
| segmentP(sK7,sK6)
| ~ spl16_1
| ~ spl16_19 ),
inference(subsumption_resolution,[],[f748,f200]) ).
fof(f748,plain,
( ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_1
| ~ spl16_19 ),
inference(subsumption_resolution,[],[f747,f648]) ).
fof(f648,plain,
( ssList(sK3(sK7,sK6))
| ~ spl16_19 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f747,plain,
( ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_1 ),
inference(subsumption_resolution,[],[f737,f201]) ).
fof(f201,plain,
ssList(sK7),
inference(cnf_transformation,[],[f163]) ).
fof(f737,plain,
( ~ ssList(sK7)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_1 ),
inference(superposition,[],[f279,f556]) ).
fof(f556,plain,
( sK7 = app(app(sK2(sK7,sK6),sK6),sK3(sK7,sK6))
| ~ spl16_1 ),
inference(resolution,[],[f289,f195]) ).
fof(f195,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f279,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,[],[f256]) ).
fof(f256,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,[],[f188]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1))
& ssList(sK14(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f185,f187,f186]) ).
fof(f186,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f187,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f185,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,[],[f184]) ).
fof(f184,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,[],[f134]) ).
fof(f134,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/sandbox/tmp/tmp.JqVdetbkRY/Vampire---4.8_15955',ax7) ).
fof(f700,plain,
( ~ spl16_1
| spl16_19 ),
inference(avatar_contradiction_clause,[],[f699]) ).
fof(f699,plain,
( $false
| ~ spl16_1
| spl16_19 ),
inference(subsumption_resolution,[],[f698,f289]) ).
fof(f698,plain,
( ~ sP0(sK7,sK6)
| spl16_19 ),
inference(resolution,[],[f649,f193]) ).
fof(f193,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f649,plain,
( ~ ssList(sK3(sK7,sK6))
| spl16_19 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f300,plain,
( ~ spl16_3
| ~ spl16_2 ),
inference(avatar_split_clause,[],[f268,f291,f296]) ).
fof(f296,plain,
( spl16_3
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_3])]) ).
fof(f268,plain,
( nil != sK6
| nil != sK7 ),
inference(definition_unfolding,[],[f205,f203,f202]) ).
fof(f205,plain,
( nil != sK4
| nil != sK5 ),
inference(cnf_transformation,[],[f163]) ).
fof(f299,plain,
( spl16_1
| spl16_3 ),
inference(avatar_split_clause,[],[f206,f296,f287]) ).
fof(f206,plain,
( nil = sK7
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f163]) ).
fof(f294,plain,
( spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f207,f291,f287]) ).
fof(f207,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC071+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/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.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:30:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.JqVdetbkRY/Vampire---4.8_15955
% 0.60/0.76 % (16206)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.60/0.76 % (16201)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.60/0.76 % (16203)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.60/0.76 % (16202)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.60/0.76 % (16204)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.60/0.76 % (16205)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.60/0.76 % (16200)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.60/0.76 % (16207)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.60/0.78 % (16203)Instruction limit reached!
% 0.60/0.78 % (16203)------------------------------
% 0.60/0.78 % (16203)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (16203)Termination reason: Unknown
% 0.60/0.78 % (16203)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (16203)Memory used [KB]: 1711
% 0.60/0.78 % (16203)Time elapsed: 0.020 s
% 0.60/0.78 % (16203)Instructions burned: 33 (million)
% 0.60/0.78 % (16203)------------------------------
% 0.60/0.78 % (16203)------------------------------
% 0.60/0.78 % (16204)Instruction limit reached!
% 0.60/0.78 % (16204)------------------------------
% 0.60/0.78 % (16204)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (16204)Termination reason: Unknown
% 0.60/0.78 % (16204)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (16204)Memory used [KB]: 2140
% 0.60/0.78 % (16204)Time elapsed: 0.021 s
% 0.60/0.78 % (16204)Instructions burned: 35 (million)
% 0.60/0.78 % (16204)------------------------------
% 0.60/0.78 % (16204)------------------------------
% 0.60/0.78 % (16205)Instruction limit reached!
% 0.60/0.78 % (16205)------------------------------
% 0.60/0.78 % (16205)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (16205)Termination reason: Unknown
% 0.60/0.78 % (16205)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (16205)Memory used [KB]: 1497
% 0.60/0.78 % (16205)Time elapsed: 0.022 s
% 0.60/0.78 % (16205)Instructions burned: 46 (million)
% 0.60/0.78 % (16205)------------------------------
% 0.60/0.78 % (16205)------------------------------
% 0.60/0.78 % (16206)Instruction limit reached!
% 0.60/0.78 % (16206)------------------------------
% 0.60/0.78 % (16206)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (16206)Termination reason: Unknown
% 0.60/0.78 % (16206)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (16206)Memory used [KB]: 2299
% 0.60/0.78 % (16206)Time elapsed: 0.025 s
% 0.60/0.78 % (16206)Instructions burned: 84 (million)
% 0.60/0.78 % (16206)------------------------------
% 0.60/0.78 % (16206)------------------------------
% 0.60/0.78 % (16208)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.60/0.79 % (16200)Instruction limit reached!
% 0.60/0.79 % (16200)------------------------------
% 0.60/0.79 % (16200)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (16200)Termination reason: Unknown
% 0.60/0.79 % (16200)Termination phase: Saturation
% 0.60/0.79
% 0.60/0.79 % (16200)Memory used [KB]: 1501
% 0.60/0.79 % (16200)Time elapsed: 0.024 s
% 0.60/0.79 % (16200)Instructions burned: 34 (million)
% 0.60/0.79 % (16200)------------------------------
% 0.60/0.79 % (16200)------------------------------
% 0.60/0.79 % (16209)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.60/0.79 % (16210)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.60/0.79 % (16211)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2995ds/52Mi)
% 0.60/0.79 % (16202)First to succeed.
% 0.60/0.79 % (16212)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2995ds/518Mi)
% 0.60/0.79 % (16202)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16196"
% 0.60/0.79 % (16202)Refutation found. Thanks to Tanya!
% 0.60/0.79 % SZS status Theorem for Vampire---4
% 0.60/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.79 % (16202)------------------------------
% 0.60/0.79 % (16202)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (16202)Termination reason: Refutation
% 0.60/0.79
% 0.60/0.79 % (16202)Memory used [KB]: 1557
% 0.60/0.79 % (16202)Time elapsed: 0.031 s
% 0.60/0.79 % (16202)Instructions burned: 49 (million)
% 0.60/0.79 % (16196)Success in time 0.429 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------