TSTP Solution File: SWC084+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC084+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/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 : Tue May 21 04:36:07 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 26
% Syntax : Number of formulae : 133 ( 10 unt; 0 def)
% Number of atoms : 824 ( 146 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 1179 ( 488 ~; 449 |; 187 &)
% ( 13 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 247 ( 182 !; 65 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f646,plain,
$false,
inference(avatar_sat_refutation,[],[f283,f284,f285,f292,f315,f393,f410,f642]) ).
fof(f642,plain,
( ~ spl13_3
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(avatar_contradiction_clause,[],[f641]) ).
fof(f641,plain,
( $false
| ~ spl13_3
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f640,f266]) ).
fof(f266,plain,
( memberP(sK3,sK4)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f264,plain,
( spl13_3
<=> memberP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
fof(f640,plain,
( ~ memberP(sK3,sK4)
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f639,f174]) ).
fof(f174,plain,
ssList(sK3),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& 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])],[f100,f144,f143,f142,f141,f140]) ).
fof(f140,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& neq(X1,nil)
& 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] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& 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] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ? [X6] :
( segmentP(X0,X6)
& segmentP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X1,nil)
| 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] :
( leq(X5,X6)
& memberP(X3,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X3,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f639,plain,
( ~ ssList(sK3)
| ~ memberP(sK3,sK4)
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f635]) ).
fof(f635,plain,
( ~ ssList(sK3)
| ~ memberP(sK3,sK4)
| ~ ssList(sK3)
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f634,f218]) ).
fof(f218,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f634,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f633,f276]) ).
fof(f276,plain,
( ssItem(sK4)
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl13_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_5])]) ).
fof(f633,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f632]) ).
fof(f632,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f631,f210]) ).
fof(f210,plain,
! [X0,X1] :
( ssList(sK9(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f159,f161,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(sK9(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0,X1] :
( ? [X5] :
( app(sK9(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
=> ( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f158]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f631,plain,
( ! [X0] :
( ~ ssList(sK9(X0,sK4))
| ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f630,f276]) ).
fof(f630,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f629]) ).
fof(f629,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f628,f211]) ).
fof(f211,plain,
! [X0,X1] :
( ssList(sK10(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f628,plain,
( ! [X0] :
( ~ ssList(sK10(X0,sK4))
| ~ ssList(X0)
| ~ segmentP(sK3,X0)
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f620,f276]) ).
fof(f620,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK10(X0,sK4))
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f619]) ).
fof(f619,plain,
( ! [X0] :
( ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK10(X0,sK4))
| ~ ssList(sK9(X0,sK4))
| ~ memberP(X0,sK4)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(superposition,[],[f612,f212]) ).
fof(f212,plain,
! [X0,X1] :
( app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f612,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f609,f276]) ).
fof(f609,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK4) )
| ~ spl13_4
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f604]) ).
fof(f604,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X1,cons(sK4,X0)))
| ~ ssList(app(X1,cons(sK4,X0)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_7 ),
inference(superposition,[],[f477,f233]) ).
fof(f233,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,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/benchmark/theBenchmark.p',ax81) ).
fof(f477,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f470,f321]) ).
fof(f321,plain,
( ssList(cons(sK4,nil))
| ~ spl13_4 ),
inference(superposition,[],[f173,f271]) ).
fof(f271,plain,
( sK2 = cons(sK4,nil)
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f269,plain,
( spl13_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
fof(f173,plain,
ssList(sK2),
inference(cnf_transformation,[],[f145]) ).
fof(f470,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil)) )
| ~ spl13_4
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f467]) ).
fof(f467,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(app(X0,app(cons(sK4,nil),X1)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK4,nil))
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_7 ),
inference(superposition,[],[f420,f232]) ).
fof(f232,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f420,plain,
( ! [X0,X1] :
( ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl13_4
| ~ spl13_7 ),
inference(subsumption_resolution,[],[f415,f321]) ).
fof(f415,plain,
( ! [X0,X1] :
( ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil)) )
| ~ spl13_7 ),
inference(duplicate_literal_removal,[],[f413]) ).
fof(f413,plain,
( ! [X0,X1] :
( ~ ssList(app(app(X0,cons(sK4,nil)),X1))
| ~ segmentP(sK3,app(app(X0,cons(sK4,nil)),X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(app(app(X0,cons(sK4,nil)),X1)) )
| ~ spl13_7 ),
inference(resolution,[],[f388,f248]) ).
fof(f248,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f224]) ).
fof(f224,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,[],[f168]) ).
fof(f168,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0
& ssList(sK12(X0,X1))
& ssList(sK11(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f165,f167,f166]) ).
fof(f166,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK11(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f167,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK11(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f165,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,[],[f164]) ).
fof(f164,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,[],[f123]) ).
fof(f123,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/benchmark/theBenchmark.p',ax7) ).
fof(f388,plain,
( ! [X0] :
( ~ segmentP(X0,cons(sK4,nil))
| ~ ssList(X0)
| ~ segmentP(sK3,X0) )
| ~ spl13_7 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f387,plain,
( spl13_7
<=> ! [X0] :
( ~ segmentP(X0,cons(sK4,nil))
| ~ ssList(X0)
| ~ segmentP(sK3,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_7])]) ).
fof(f410,plain,
( spl13_2
| ~ spl13_4
| spl13_8 ),
inference(avatar_contradiction_clause,[],[f409]) ).
fof(f409,plain,
( $false
| spl13_2
| ~ spl13_4
| spl13_8 ),
inference(subsumption_resolution,[],[f408,f321]) ).
fof(f408,plain,
( ~ ssList(cons(sK4,nil))
| spl13_2
| ~ spl13_4
| spl13_8 ),
inference(subsumption_resolution,[],[f407,f202]) ).
fof(f202,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f407,plain,
( ~ ssList(nil)
| ~ ssList(cons(sK4,nil))
| spl13_2
| ~ spl13_4
| spl13_8 ),
inference(subsumption_resolution,[],[f396,f320]) ).
fof(f320,plain,
( nil != cons(sK4,nil)
| spl13_2
| ~ spl13_4 ),
inference(superposition,[],[f260,f271]) ).
fof(f260,plain,
( nil != sK2
| spl13_2 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f259,plain,
( spl13_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
fof(f396,plain,
( nil = cons(sK4,nil)
| ~ ssList(nil)
| ~ ssList(cons(sK4,nil))
| spl13_8 ),
inference(resolution,[],[f392,f199]) ).
fof(f199,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,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/benchmark/theBenchmark.p',ax15) ).
fof(f392,plain,
( ~ neq(cons(sK4,nil),nil)
| spl13_8 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f390,plain,
( spl13_8
<=> neq(cons(sK4,nil),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_8])]) ).
fof(f393,plain,
( spl13_7
| ~ spl13_8
| ~ spl13_4 ),
inference(avatar_split_clause,[],[f385,f269,f390,f387]) ).
fof(f385,plain,
( ! [X0] :
( ~ neq(cons(sK4,nil),nil)
| ~ segmentP(X0,cons(sK4,nil))
| ~ segmentP(sK3,X0)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(subsumption_resolution,[],[f384,f321]) ).
fof(f384,plain,
( ! [X0] :
( ~ neq(cons(sK4,nil),nil)
| ~ ssList(cons(sK4,nil))
| ~ segmentP(X0,cons(sK4,nil))
| ~ segmentP(sK3,X0)
| ~ ssList(X0) )
| ~ spl13_4 ),
inference(duplicate_literal_removal,[],[f380]) ).
fof(f380,plain,
( ! [X0] :
( ~ neq(cons(sK4,nil),nil)
| ~ ssList(cons(sK4,nil))
| ~ segmentP(X0,cons(sK4,nil))
| ~ segmentP(sK3,X0)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil)) )
| ~ spl13_4 ),
inference(resolution,[],[f331,f218]) ).
fof(f331,plain,
( ! [X0,X1] :
( ~ segmentP(cons(sK4,nil),X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(X1,X0)
| ~ segmentP(sK3,X1)
| ~ ssList(X1) )
| ~ spl13_4 ),
inference(forward_demodulation,[],[f330,f271]) ).
fof(f330,plain,
! [X0,X1] :
( ~ segmentP(sK2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(X1,X0)
| ~ segmentP(sK3,X1)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f325,f174]) ).
fof(f325,plain,
! [X0,X1] :
( ~ segmentP(sK2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(X1,X0)
| ~ segmentP(sK3,X1)
| ~ ssList(X1)
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f323]) ).
fof(f323,plain,
! [X0,X1] :
( ~ segmentP(sK2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(X1,X0)
| ~ segmentP(sK3,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(sK3) ),
inference(resolution,[],[f239,f220]) ).
fof(f220,plain,
! [X2,X0,X1] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X0,X1) )
=> segmentP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).
fof(f239,plain,
! [X6] :
( ~ segmentP(sK3,X6)
| ~ segmentP(sK2,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f178,f176,f175]) ).
fof(f175,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f145]) ).
fof(f176,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f145]) ).
fof(f178,plain,
! [X6] :
( ~ segmentP(sK0,X6)
| ~ segmentP(sK1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f145]) ).
fof(f315,plain,
( ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(avatar_contradiction_clause,[],[f314]) ).
fof(f314,plain,
( $false
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f313,f202]) ).
fof(f313,plain,
( ~ ssList(nil)
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(subsumption_resolution,[],[f307,f276]) ).
fof(f307,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl13_2
| ~ spl13_4 ),
inference(trivial_inequality_removal,[],[f300]) ).
fof(f300,plain,
( nil != nil
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl13_2
| ~ spl13_4 ),
inference(superposition,[],[f196,f293]) ).
fof(f293,plain,
( nil = cons(sK4,nil)
| ~ spl13_2
| ~ spl13_4 ),
inference(forward_demodulation,[],[f271,f261]) ).
fof(f261,plain,
( nil = sK2
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f196,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/benchmark/theBenchmark.p',ax18) ).
fof(f292,plain,
~ spl13_6,
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl13_6 ),
inference(subsumption_resolution,[],[f290,f202]) ).
fof(f290,plain,
( ~ ssList(nil)
| ~ spl13_6 ),
inference(resolution,[],[f287,f251]) ).
fof(f251,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f243]) ).
fof(f243,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f198]) ).
fof(f198,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f287,plain,
( neq(nil,nil)
| ~ spl13_6 ),
inference(superposition,[],[f240,f281]) ).
fof(f281,plain,
( nil = sK3
| ~ spl13_6 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f279,plain,
( spl13_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl13_6])]) ).
fof(f240,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f177,f175]) ).
fof(f177,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f145]) ).
fof(f285,plain,
( spl13_5
| spl13_6 ),
inference(avatar_split_clause,[],[f179,f279,f274]) ).
fof(f179,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f145]) ).
fof(f284,plain,
( spl13_4
| spl13_6 ),
inference(avatar_split_clause,[],[f180,f279,f269]) ).
fof(f180,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f145]) ).
fof(f283,plain,
( spl13_3
| spl13_6 ),
inference(avatar_split_clause,[],[f181,f279,f264]) ).
fof(f181,plain,
( nil = sK3
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC084+1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/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.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 03:41:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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/benchmark/theBenchmark.p
% 0.57/0.75 % (18991)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.57/0.75 % (18996)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.57/0.75 % (18993)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.75 % (18998)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.57/0.75 % (18994)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.57/0.75 % (18992)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.57/0.75 % (18995)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.57/0.75 % (18997)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.59/0.76 % (18996)First to succeed.
% 0.59/0.76 % (18991)Instruction limit reached!
% 0.59/0.76 % (18991)------------------------------
% 0.59/0.76 % (18991)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (18991)Termination reason: Unknown
% 0.59/0.76 % (18991)Termination phase: Saturation
% 0.59/0.76
% 0.59/0.76 % (18991)Memory used [KB]: 1537
% 0.59/0.76 % (18991)Time elapsed: 0.014 s
% 0.59/0.76 % (18991)Instructions burned: 36 (million)
% 0.59/0.76 % (18991)------------------------------
% 0.59/0.76 % (18991)------------------------------
% 0.59/0.76 % (18996)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18990"
% 0.59/0.76 % (18996)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for theBenchmark
% 0.59/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.76 % (18996)------------------------------
% 0.59/0.76 % (18996)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (18996)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (18996)Memory used [KB]: 1370
% 0.59/0.77 % (18996)Time elapsed: 0.014 s
% 0.59/0.77 % (18996)Instructions burned: 26 (million)
% 0.59/0.77 % (18990)Success in time 0.399 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------