TSTP Solution File: SWC083+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC083+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 : n020.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:28 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 20
% Syntax : Number of formulae : 107 ( 17 unt; 0 def)
% Number of atoms : 512 ( 106 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 638 ( 233 ~; 210 |; 155 &)
% ( 7 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 169 ( 98 !; 71 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1067,plain,
$false,
inference(avatar_sat_refutation,[],[f354,f598,f645,f1064]) ).
fof(f1064,plain,
( ~ spl13_1
| ~ spl13_3
| ~ spl13_11 ),
inference(avatar_contradiction_clause,[],[f1063]) ).
fof(f1063,plain,
( $false
| ~ spl13_1
| ~ spl13_3
| ~ spl13_11 ),
inference(subsumption_resolution,[],[f1062,f157]) ).
fof(f157,plain,
ssList(sK3),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
( sK3 = app(sK4,sK6)
& sK2 = app(app(sK4,sK5),sK6)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& 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,sK5,sK6])],[f99,f136,f135,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(X0,X7)
| ~ segmentP(X1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(X1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(X1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK3
& app(app(X4,X5),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK3
& app(app(X4,X5),X6) = sK2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK3 = app(sK4,X6)
& sK2 = app(app(sK4,X5),X6)
& ssList(X6) )
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X5] :
( ? [X6] :
( sK3 = app(sK4,X6)
& sK2 = app(app(sK4,X5),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK3 = app(sK4,X6)
& sK2 = app(app(sK4,sK5),X6)
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X6] :
( sK3 = app(sK4,X6)
& sK2 = app(app(sK4,sK5),X6)
& ssList(X6) )
=> ( sK3 = app(sK4,sK6)
& sK2 = app(app(sK4,sK5),sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ~ segmentP(X0,X7)
| ~ segmentP(X1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X4,X6) != X3
| app(app(X4,X5),X6) != X2
| ~ ssList(X6) ) ) )
| ? [X7] :
( segmentP(X0,X7)
& segmentP(X1,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( app(X5,X7) != X3
| app(app(X5,X6),X7) != X2
| ~ ssList(X7) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( app(X5,X7) != X3
| app(app(X5,X6),X7) != X2
| ~ ssList(X7) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998',co1) ).
fof(f1062,plain,
( ~ ssList(sK3)
| ~ spl13_1
| ~ spl13_3
| ~ spl13_11 ),
inference(subsumption_resolution,[],[f1045,f223]) ).
fof(f223,plain,
~ segmentP(sK2,sK3),
inference(subsumption_resolution,[],[f222,f206]) ).
fof(f206,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f160,f158]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f137]) ).
fof(f160,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f137]) ).
fof(f222,plain,
( ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(subsumption_resolution,[],[f221,f157]) ).
fof(f221,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f220,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil)
| ~ ssList(sK3) ),
inference(resolution,[],[f187,f205]) ).
fof(f205,plain,
! [X7] :
( ~ segmentP(sK3,X7)
| ~ segmentP(sK2,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) ),
inference(definition_unfolding,[],[f161,f159,f158]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f161,plain,
! [X7] :
( ~ segmentP(sK0,X7)
| ~ segmentP(sK1,X7)
| ~ neq(X7,nil)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f137]) ).
fof(f187,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,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.GKdd2H8fxn/Vampire---4.8_3998',ax55) ).
fof(f1045,plain,
( segmentP(sK2,sK3)
| ~ ssList(sK3)
| ~ spl13_1
| ~ spl13_3
| ~ spl13_11 ),
inference(superposition,[],[f819,f686]) ).
fof(f686,plain,
( sK2 = app(sK3,sK5)
| ~ spl13_1
| ~ spl13_3
| ~ spl13_11 ),
inference(subsumption_resolution,[],[f671,f647]) ).
fof(f647,plain,
( ssList(app(sK3,sK5))
| ~ spl13_3
| ~ spl13_11 ),
inference(backward_demodulation,[],[f262,f393]) ).
fof(f393,plain,
( sK3 = sK4
| ~ spl13_11 ),
inference(avatar_component_clause,[],[f392]) ).
fof(f392,plain,
( spl13_11
<=> sK3 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_11])]) ).
fof(f262,plain,
( ssList(app(sK4,sK5))
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl13_3
<=> ssList(app(sK4,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
fof(f671,plain,
( sK2 = app(sK3,sK5)
| ~ ssList(app(sK3,sK5))
| ~ spl13_1
| ~ spl13_11 ),
inference(superposition,[],[f167,f655]) ).
fof(f655,plain,
( sK2 = app(app(sK3,sK5),nil)
| ~ spl13_1
| ~ spl13_11 ),
inference(backward_demodulation,[],[f600,f393]) ).
fof(f600,plain,
( sK2 = app(app(sK4,sK5),nil)
| ~ spl13_1 ),
inference(backward_demodulation,[],[f165,f253]) ).
fof(f253,plain,
( nil = sK6
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f251,plain,
( spl13_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
fof(f165,plain,
sK2 = app(app(sK4,sK5),sK6),
inference(cnf_transformation,[],[f137]) ).
fof(f167,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998',ax84) ).
fof(f819,plain,
! [X0] :
( segmentP(app(X0,sK5),X0)
| ~ ssList(X0) ),
inference(resolution,[],[f476,f163]) ).
fof(f163,plain,
ssList(sK5),
inference(cnf_transformation,[],[f137]) ).
fof(f476,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f475,f177]) ).
fof(f177,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,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.GKdd2H8fxn/Vampire---4.8_3998',ax26) ).
fof(f475,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f468,f182]) ).
fof(f182,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998',ax17) ).
fof(f468,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f464]) ).
fof(f464,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f214,f175]) ).
fof(f175,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,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/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998',ax28) ).
fof(f214,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,[],[f193]) ).
fof(f193,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,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK7(X0,X1),X1),sK8(X0,X1)) = X0
& ssList(sK8(X0,X1))
& ssList(sK7(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f144,f146,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK7(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK7(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK7(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK7(X0,X1),X1),sK8(X0,X1)) = X0
& ssList(sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f144,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,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998',ax7) ).
fof(f645,plain,
( spl13_11
| ~ spl13_1 ),
inference(avatar_split_clause,[],[f644,f251,f392]) ).
fof(f644,plain,
( sK3 = sK4
| ~ spl13_1 ),
inference(subsumption_resolution,[],[f626,f162]) ).
fof(f162,plain,
ssList(sK4),
inference(cnf_transformation,[],[f137]) ).
fof(f626,plain,
( sK3 = sK4
| ~ ssList(sK4)
| ~ spl13_1 ),
inference(superposition,[],[f601,f167]) ).
fof(f601,plain,
( sK3 = app(sK4,nil)
| ~ spl13_1 ),
inference(backward_demodulation,[],[f166,f253]) ).
fof(f166,plain,
sK3 = app(sK4,sK6),
inference(cnf_transformation,[],[f137]) ).
fof(f598,plain,
( spl13_1
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f597,f261,f251]) ).
fof(f597,plain,
( nil = sK6
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f596,f164]) ).
fof(f164,plain,
ssList(sK6),
inference(cnf_transformation,[],[f137]) ).
fof(f596,plain,
( nil = sK6
| ~ ssList(sK6)
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f586,f182]) ).
fof(f586,plain,
( nil = sK6
| ~ ssList(nil)
| ~ ssList(sK6)
| ~ spl13_3 ),
inference(resolution,[],[f524,f179]) ).
fof(f179,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,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.GKdd2H8fxn/Vampire---4.8_3998',ax15) ).
fof(f524,plain,
( ~ neq(sK6,nil)
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f523,f164]) ).
fof(f523,plain,
( ~ neq(sK6,nil)
| ~ ssList(sK6)
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f518,f517]) ).
fof(f517,plain,
( segmentP(sK2,sK6)
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f516,f182]) ).
fof(f516,plain,
( ~ ssList(nil)
| segmentP(sK2,sK6)
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f513,f156]) ).
fof(f156,plain,
ssList(sK2),
inference(cnf_transformation,[],[f137]) ).
fof(f513,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK6)
| ~ spl13_3 ),
inference(duplicate_literal_removal,[],[f512]) ).
fof(f512,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK6)
| ~ ssList(sK2)
| ~ spl13_3 ),
inference(superposition,[],[f474,f167]) ).
fof(f474,plain,
( ! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| segmentP(app(sK2,X0),sK6) )
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f473,f164]) ).
fof(f473,plain,
( ! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK6)
| segmentP(app(sK2,X0),sK6) )
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f462,f262]) ).
fof(f462,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(app(sK4,sK5))
| ~ ssList(sK6)
| segmentP(app(sK2,X0),sK6) ),
inference(superposition,[],[f214,f165]) ).
fof(f518,plain,
( ~ segmentP(sK2,sK6)
| ~ neq(sK6,nil)
| ~ ssList(sK6) ),
inference(resolution,[],[f510,f205]) ).
fof(f510,plain,
segmentP(sK3,sK6),
inference(subsumption_resolution,[],[f509,f182]) ).
fof(f509,plain,
( ~ ssList(nil)
| segmentP(sK3,sK6) ),
inference(subsumption_resolution,[],[f506,f157]) ).
fof(f506,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK6) ),
inference(duplicate_literal_removal,[],[f505]) ).
fof(f505,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK6)
| ~ ssList(sK3) ),
inference(superposition,[],[f472,f167]) ).
fof(f472,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| segmentP(app(sK3,X0),sK6) ),
inference(subsumption_resolution,[],[f471,f164]) ).
fof(f471,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK6)
| segmentP(app(sK3,X0),sK6) ),
inference(subsumption_resolution,[],[f461,f162]) ).
fof(f461,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK4)
| ~ ssList(sK6)
| segmentP(app(sK3,X0),sK6) ),
inference(superposition,[],[f214,f166]) ).
fof(f354,plain,
spl13_3,
inference(avatar_contradiction_clause,[],[f353]) ).
fof(f353,plain,
( $false
| spl13_3 ),
inference(subsumption_resolution,[],[f352,f162]) ).
fof(f352,plain,
( ~ ssList(sK4)
| spl13_3 ),
inference(subsumption_resolution,[],[f351,f163]) ).
fof(f351,plain,
( ~ ssList(sK5)
| ~ ssList(sK4)
| spl13_3 ),
inference(resolution,[],[f263,f177]) ).
fof(f263,plain,
( ~ ssList(app(sK4,sK5))
| spl13_3 ),
inference(avatar_component_clause,[],[f261]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC083+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n020.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:31:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.GKdd2H8fxn/Vampire---4.8_3998
% 0.54/0.75 % (4113)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.54/0.75 % (4106)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.54/0.75 % (4110)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.54/0.75 % (4109)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.54/0.75 % (4108)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.54/0.75 % (4112)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.54/0.75 % (4111)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.75 % (4114)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.77 % (4110)Instruction limit reached!
% 0.60/0.77 % (4110)------------------------------
% 0.60/0.77 % (4110)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (4110)Termination reason: Unknown
% 0.60/0.77 % (4110)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (4110)Memory used [KB]: 1640
% 0.60/0.77 % (4110)Time elapsed: 0.018 s
% 0.60/0.77 % (4110)Instructions burned: 33 (million)
% 0.60/0.77 % (4110)------------------------------
% 0.60/0.77 % (4110)------------------------------
% 0.60/0.77 % (4111)Instruction limit reached!
% 0.60/0.77 % (4111)------------------------------
% 0.60/0.77 % (4111)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (4111)Termination reason: Unknown
% 0.60/0.77 % (4111)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (4111)Memory used [KB]: 2020
% 0.60/0.77 % (4111)Time elapsed: 0.020 s
% 0.60/0.77 % (4111)Instructions burned: 35 (million)
% 0.60/0.77 % (4111)------------------------------
% 0.60/0.77 % (4111)------------------------------
% 0.60/0.77 % (4106)Instruction limit reached!
% 0.60/0.77 % (4106)------------------------------
% 0.60/0.77 % (4106)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (4106)Termination reason: Unknown
% 0.60/0.77 % (4106)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (4106)Memory used [KB]: 1397
% 0.60/0.77 % (4106)Time elapsed: 0.021 s
% 0.60/0.77 % (4106)Instructions burned: 35 (million)
% 0.60/0.77 % (4106)------------------------------
% 0.60/0.77 % (4106)------------------------------
% 0.60/0.77 % (4115)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.77 % (4113)Instruction limit reached!
% 0.60/0.77 % (4113)------------------------------
% 0.60/0.77 % (4113)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (4113)Termination reason: Unknown
% 0.60/0.77 % (4113)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (4113)Memory used [KB]: 2162
% 0.60/0.77 % (4113)Time elapsed: 0.025 s
% 0.60/0.77 % (4113)Instructions burned: 84 (million)
% 0.60/0.77 % (4113)------------------------------
% 0.60/0.77 % (4113)------------------------------
% 0.60/0.77 % (4116)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.77 % (4117)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.78 % (4118)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.78 % (4109)First to succeed.
% 0.60/0.78 % (4112)Instruction limit reached!
% 0.60/0.78 % (4112)------------------------------
% 0.60/0.78 % (4112)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (4112)Termination reason: Unknown
% 0.60/0.78 % (4112)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (4112)Memory used [KB]: 1610
% 0.60/0.78 % (4112)Time elapsed: 0.028 s
% 0.60/0.78 % (4112)Instructions burned: 46 (million)
% 0.60/0.78 % (4112)------------------------------
% 0.60/0.78 % (4112)------------------------------
% 0.60/0.78 % (4114)Instruction limit reached!
% 0.60/0.78 % (4114)------------------------------
% 0.60/0.78 % (4114)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (4114)Termination reason: Unknown
% 0.60/0.78 % (4114)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (4114)Memory used [KB]: 1589
% 0.60/0.78 % (4114)Time elapsed: 0.029 s
% 0.60/0.78 % (4114)Instructions burned: 56 (million)
% 0.60/0.78 % (4114)------------------------------
% 0.60/0.78 % (4114)------------------------------
% 0.60/0.78 % (4109)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4105"
% 0.60/0.78 % (4109)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for Vampire---4
% 0.60/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.78 % (4109)------------------------------
% 0.60/0.78 % (4109)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (4109)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (4109)Memory used [KB]: 1453
% 0.60/0.78 % (4109)Time elapsed: 0.029 s
% 0.60/0.78 % (4109)Instructions burned: 46 (million)
% 0.60/0.78 % (4105)Success in time 0.414 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------