TSTP Solution File: SWC109+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC109+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 : n018.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:17 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 29
% Syntax : Number of formulae : 147 ( 7 unt; 0 def)
% Number of atoms : 766 ( 189 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 992 ( 373 ~; 355 |; 209 &)
% ( 19 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 12 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 209 ( 146 !; 63 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f823,plain,
$false,
inference(avatar_sat_refutation,[],[f305,f310,f316,f317,f359,f385,f426,f530,f546,f554,f609,f614,f778,f822]) ).
fof(f822,plain,
( spl16_3
| ~ spl16_6
| ~ spl16_22 ),
inference(avatar_contradiction_clause,[],[f821]) ).
fof(f821,plain,
( $false
| spl16_3
| ~ spl16_6
| ~ spl16_22 ),
inference(subsumption_resolution,[],[f820,f315]) ).
fof(f315,plain,
( sP0(sK7,sK6)
| ~ spl16_6 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f313,plain,
( spl16_6
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_6])]) ).
fof(f820,plain,
( ~ sP0(sK7,sK6)
| spl16_3
| ~ spl16_6
| ~ spl16_22 ),
inference(resolution,[],[f817,f190]) ).
fof(f190,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,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])],[f152,f155,f154,f153]) ).
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) )
=> ( ? [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(f154,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(f155,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(f152,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,[],[f151]) ).
fof(f151,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,[],[f149]) ).
fof(f149,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(f817,plain,
( ~ ssList(sK2(sK7,sK6))
| spl16_3
| ~ spl16_6
| ~ spl16_22 ),
inference(subsumption_resolution,[],[f816,f299]) ).
fof(f299,plain,
( ~ segmentP(sK7,sK6)
| spl16_3 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f297,plain,
( spl16_3
<=> segmentP(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_3])]) ).
fof(f816,plain,
( ~ ssList(sK2(sK7,sK6))
| segmentP(sK7,sK6)
| ~ spl16_6
| ~ spl16_22 ),
inference(subsumption_resolution,[],[f815,f198]) ).
fof(f198,plain,
ssList(sK6),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f150,f160,f159,f158,f157]) ).
fof(f157,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,sK4)
| ~ neq(sK4,nil) )
& neq(X1,nil) )
| ( nil != sK4
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,sK4)
| ~ neq(sK4,nil) )
& neq(X1,nil) )
| ( nil != sK4
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
( ? [X3] :
( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ( ( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil) )
& neq(sK5,nil) )
| ( nil != sK4
& nil = sK5 ) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f149]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( 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) ) )
& 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] :
( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(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) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f815,plain,
( ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_6
| ~ spl16_22 ),
inference(subsumption_resolution,[],[f814,f725]) ).
fof(f725,plain,
( ssList(sK3(sK7,sK6))
| ~ spl16_22 ),
inference(avatar_component_clause,[],[f724]) ).
fof(f724,plain,
( spl16_22
<=> ssList(sK3(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_22])]) ).
fof(f814,plain,
( ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f804,f199]) ).
fof(f199,plain,
ssList(sK7),
inference(cnf_transformation,[],[f161]) ).
fof(f804,plain,
( ~ ssList(sK7)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK6)
| segmentP(sK7,sK6)
| ~ spl16_6 ),
inference(superposition,[],[f281,f618]) ).
fof(f618,plain,
( sK7 = app(app(sK2(sK7,sK6),sK6),sK3(sK7,sK6))
| ~ spl16_6 ),
inference(resolution,[],[f315,f193]) ).
fof(f193,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f156]) ).
fof(f281,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,[],[f186]) ).
fof(f186,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])],[f183,f185,f184]) ).
fof(f184,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(f185,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(f183,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,[],[f182]) ).
fof(f182,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,[],[f133]) ).
fof(f133,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(f778,plain,
( ~ spl16_6
| spl16_22 ),
inference(avatar_contradiction_clause,[],[f777]) ).
fof(f777,plain,
( $false
| ~ spl16_6
| spl16_22 ),
inference(subsumption_resolution,[],[f776,f315]) ).
fof(f776,plain,
( ~ sP0(sK7,sK6)
| spl16_22 ),
inference(resolution,[],[f726,f191]) ).
fof(f191,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
fof(f726,plain,
( ~ ssList(sK3(sK7,sK6))
| spl16_22 ),
inference(avatar_component_clause,[],[f724]) ).
fof(f614,plain,
( ~ spl16_4
| ~ spl16_6
| spl16_17 ),
inference(avatar_contradiction_clause,[],[f613]) ).
fof(f613,plain,
( $false
| ~ spl16_4
| ~ spl16_6
| spl16_17 ),
inference(subsumption_resolution,[],[f612,f422]) ).
fof(f422,plain,
( sP0(nil,sK6)
| ~ spl16_4
| ~ spl16_6 ),
inference(forward_demodulation,[],[f315,f304]) ).
fof(f304,plain,
( nil = sK7
| ~ spl16_4 ),
inference(avatar_component_clause,[],[f302]) ).
fof(f302,plain,
( spl16_4
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_4])]) ).
fof(f612,plain,
( ~ sP0(nil,sK6)
| spl16_17 ),
inference(resolution,[],[f590,f190]) ).
fof(f590,plain,
( ~ ssList(sK2(nil,sK6))
| spl16_17 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f588,plain,
( spl16_17
<=> ssList(sK2(nil,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_17])]) ).
fof(f609,plain,
( ~ spl16_17
| spl16_1
| ~ spl16_14 ),
inference(avatar_split_clause,[],[f608,f527,f289,f588]) ).
fof(f289,plain,
( spl16_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).
fof(f527,plain,
( spl16_14
<=> nil = app(sK2(nil,sK6),sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_14])]) ).
fof(f608,plain,
( ~ ssList(sK2(nil,sK6))
| spl16_1
| ~ spl16_14 ),
inference(subsumption_resolution,[],[f607,f198]) ).
fof(f607,plain,
( ~ ssList(sK6)
| ~ ssList(sK2(nil,sK6))
| spl16_1
| ~ spl16_14 ),
inference(subsumption_resolution,[],[f583,f291]) ).
fof(f291,plain,
( nil != sK6
| spl16_1 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f583,plain,
( nil = sK6
| ~ ssList(sK6)
| ~ ssList(sK2(nil,sK6))
| ~ spl16_14 ),
inference(trivial_inequality_removal,[],[f581]) ).
fof(f581,plain,
( nil != nil
| nil = sK6
| ~ ssList(sK6)
| ~ ssList(sK2(nil,sK6))
| ~ spl16_14 ),
inference(superposition,[],[f220,f529]) ).
fof(f529,plain,
( nil = app(sK2(nil,sK6),sK6)
| ~ spl16_14 ),
inference(avatar_component_clause,[],[f527]) ).
fof(f220,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f168]) ).
fof(f168,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f554,plain,
( ~ spl16_4
| ~ spl16_6
| spl16_12 ),
inference(avatar_contradiction_clause,[],[f553]) ).
fof(f553,plain,
( $false
| ~ spl16_4
| ~ spl16_6
| spl16_12 ),
inference(subsumption_resolution,[],[f552,f422]) ).
fof(f552,plain,
( ~ sP0(nil,sK6)
| spl16_12 ),
inference(resolution,[],[f521,f191]) ).
fof(f521,plain,
( ~ ssList(sK3(nil,sK6))
| spl16_12 ),
inference(avatar_component_clause,[],[f519]) ).
fof(f519,plain,
( spl16_12
<=> ssList(sK3(nil,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_12])]) ).
fof(f546,plain,
( ~ spl16_4
| ~ spl16_6
| spl16_11 ),
inference(avatar_contradiction_clause,[],[f545]) ).
fof(f545,plain,
( $false
| ~ spl16_4
| ~ spl16_6
| spl16_11 ),
inference(subsumption_resolution,[],[f544,f422]) ).
fof(f544,plain,
( ~ sP0(nil,sK6)
| spl16_11 ),
inference(resolution,[],[f543,f190]) ).
fof(f543,plain,
( ~ ssList(sK2(nil,sK6))
| spl16_11 ),
inference(subsumption_resolution,[],[f542,f198]) ).
fof(f542,plain,
( ~ ssList(sK6)
| ~ ssList(sK2(nil,sK6))
| spl16_11 ),
inference(resolution,[],[f517,f229]) ).
fof(f229,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,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/benchmark/theBenchmark.p',ax26) ).
fof(f517,plain,
( ~ ssList(app(sK2(nil,sK6),sK6))
| spl16_11 ),
inference(avatar_component_clause,[],[f515]) ).
fof(f515,plain,
( spl16_11
<=> ssList(app(sK2(nil,sK6),sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_11])]) ).
fof(f530,plain,
( ~ spl16_11
| ~ spl16_12
| spl16_14
| ~ spl16_4
| ~ spl16_6 ),
inference(avatar_split_clause,[],[f512,f313,f302,f527,f519,f515]) ).
fof(f512,plain,
( nil = app(sK2(nil,sK6),sK6)
| ~ ssList(sK3(nil,sK6))
| ~ ssList(app(sK2(nil,sK6),sK6))
| ~ spl16_4
| ~ spl16_6 ),
inference(trivial_inequality_removal,[],[f508]) ).
fof(f508,plain,
( nil != nil
| nil = app(sK2(nil,sK6),sK6)
| ~ ssList(sK3(nil,sK6))
| ~ ssList(app(sK2(nil,sK6),sK6))
| ~ spl16_4
| ~ spl16_6 ),
inference(superposition,[],[f221,f490]) ).
fof(f490,plain,
( nil = app(app(sK2(nil,sK6),sK6),sK3(nil,sK6))
| ~ spl16_4
| ~ spl16_6 ),
inference(resolution,[],[f193,f422]) ).
fof(f221,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f426,plain,
( ~ spl16_4
| ~ spl16_5 ),
inference(avatar_contradiction_clause,[],[f425]) ).
fof(f425,plain,
( $false
| ~ spl16_4
| ~ spl16_5 ),
inference(subsumption_resolution,[],[f423,f234]) ).
fof(f234,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f423,plain,
( ~ ssList(nil)
| ~ spl16_4
| ~ spl16_5 ),
inference(resolution,[],[f408,f286]) ).
fof(f286,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f276]) ).
fof(f276,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f230]) ).
fof(f230,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f170,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f118,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(f408,plain,
( neq(nil,nil)
| ~ spl16_4
| ~ spl16_5 ),
inference(backward_demodulation,[],[f309,f304]) ).
fof(f309,plain,
( neq(sK7,nil)
| ~ spl16_5 ),
inference(avatar_component_clause,[],[f307]) ).
fof(f307,plain,
( spl16_5
<=> neq(sK7,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_5])]) ).
fof(f385,plain,
( ~ spl16_1
| ~ spl16_6 ),
inference(avatar_contradiction_clause,[],[f384]) ).
fof(f384,plain,
( $false
| ~ spl16_1
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f383,f361]) ).
fof(f361,plain,
( sP0(sK7,nil)
| ~ spl16_1
| ~ spl16_6 ),
inference(backward_demodulation,[],[f315,f290]) ).
fof(f290,plain,
( nil = sK6
| ~ spl16_1 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f383,plain,
( ~ sP0(sK7,nil)
| ~ spl16_1
| ~ spl16_6 ),
inference(resolution,[],[f382,f189]) ).
fof(f189,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
fof(f382,plain,
( ~ ssItem(sK1(sK7,nil))
| ~ spl16_1
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f381,f235]) ).
fof(f235,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f381,plain,
( memberP(nil,sK1(sK7,nil))
| ~ ssItem(sK1(sK7,nil))
| ~ spl16_1
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f375,f234]) ).
fof(f375,plain,
( memberP(nil,sK1(sK7,nil))
| ~ ssList(nil)
| ~ ssItem(sK1(sK7,nil))
| ~ spl16_1
| ~ spl16_6 ),
inference(superposition,[],[f284,f367]) ).
fof(f367,plain,
( nil = cons(sK1(sK7,nil),nil)
| ~ spl16_1
| ~ spl16_6 ),
inference(resolution,[],[f361,f192]) ).
fof(f192,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f156]) ).
fof(f284,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f278]) ).
fof(f278,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f237]) ).
fof(f237,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f172]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
fof(f359,plain,
( spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f358,f293,f289]) ).
fof(f293,plain,
( spl16_2
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).
fof(f358,plain,
( nil = sK6
| spl16_2 ),
inference(subsumption_resolution,[],[f357,f198]) ).
fof(f357,plain,
( nil = sK6
| ~ ssList(sK6)
| spl16_2 ),
inference(subsumption_resolution,[],[f352,f234]) ).
fof(f352,plain,
( nil = sK6
| ~ ssList(nil)
| ~ ssList(sK6)
| spl16_2 ),
inference(resolution,[],[f295,f231]) ).
fof(f231,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f295,plain,
( ~ neq(sK6,nil)
| spl16_2 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f317,plain,
( spl16_6
| spl16_4 ),
inference(avatar_split_clause,[],[f202,f302,f313]) ).
fof(f202,plain,
( nil = sK7
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f161]) ).
fof(f316,plain,
( spl16_6
| spl16_1 ),
inference(avatar_split_clause,[],[f203,f289,f313]) ).
fof(f203,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f161]) ).
fof(f310,plain,
( ~ spl16_1
| spl16_5 ),
inference(avatar_split_clause,[],[f270,f307,f289]) ).
fof(f270,plain,
( neq(sK7,nil)
| nil != sK6 ),
inference(definition_unfolding,[],[f205,f200,f201]) ).
fof(f201,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f161]) ).
fof(f200,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f161]) ).
fof(f205,plain,
( neq(sK5,nil)
| nil != sK4 ),
inference(cnf_transformation,[],[f161]) ).
fof(f305,plain,
( spl16_4
| ~ spl16_2
| ~ spl16_3 ),
inference(avatar_split_clause,[],[f269,f297,f293,f302]) ).
fof(f269,plain,
( ~ segmentP(sK7,sK6)
| ~ neq(sK6,nil)
| nil = sK7 ),
inference(definition_unfolding,[],[f206,f200,f201,f201,f200]) ).
fof(f206,plain,
( ~ segmentP(sK5,sK4)
| ~ neq(sK4,nil)
| nil = sK5 ),
inference(cnf_transformation,[],[f161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC109+1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/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.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 02:56:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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 % (2921)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 % (2914)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 % (2916)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 % (2915)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 % (2917)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 % (2918)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 % (2919)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 % (2920)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.57/0.75 % (2919)Refutation not found, incomplete strategy% (2919)------------------------------
% 0.57/0.75 % (2919)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (2919)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (2919)Memory used [KB]: 1166
% 0.57/0.75 % (2919)Time elapsed: 0.005 s
% 0.57/0.75 % (2919)Instructions burned: 6 (million)
% 0.57/0.75 % (2919)------------------------------
% 0.57/0.75 % (2919)------------------------------
% 0.57/0.76 % (2922)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.60/0.76 % (2921)Instruction limit reached!
% 0.60/0.76 % (2921)------------------------------
% 0.60/0.76 % (2921)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (2921)Termination reason: Unknown
% 0.60/0.76 % (2921)Termination phase: Saturation
% 0.60/0.76
% 0.60/0.76 % (2921)Memory used [KB]: 1726
% 0.60/0.76 % (2921)Time elapsed: 0.018 s
% 0.60/0.76 % (2921)Instructions burned: 56 (million)
% 0.60/0.76 % (2921)------------------------------
% 0.60/0.76 % (2921)------------------------------
% 0.60/0.77 % (2923)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 theBenchmark for (2996ds/50Mi)
% 0.60/0.77 % (2917)Instruction limit reached!
% 0.60/0.77 % (2917)------------------------------
% 0.60/0.77 % (2917)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (2918)Instruction limit reached!
% 0.60/0.77 % (2918)------------------------------
% 0.60/0.77 % (2918)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (2918)Termination reason: Unknown
% 0.60/0.77 % (2918)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (2918)Memory used [KB]: 2084
% 0.60/0.77 % (2918)Time elapsed: 0.020 s
% 0.60/0.77 % (2918)Instructions burned: 34 (million)
% 0.60/0.77 % (2918)------------------------------
% 0.60/0.77 % (2918)------------------------------
% 0.60/0.77 % (2917)Termination reason: Unknown
% 0.60/0.77 % (2917)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (2917)Memory used [KB]: 1525
% 0.60/0.77 % (2917)Time elapsed: 0.020 s
% 0.60/0.77 % (2917)Instructions burned: 34 (million)
% 0.60/0.77 % (2917)------------------------------
% 0.60/0.77 % (2917)------------------------------
% 0.60/0.77 % (2916)First to succeed.
% 0.60/0.77 % (2914)Instruction limit reached!
% 0.60/0.77 % (2914)------------------------------
% 0.60/0.77 % (2914)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (2914)Termination reason: Unknown
% 0.60/0.77 % (2914)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (2914)Memory used [KB]: 1543
% 0.60/0.77 % (2914)Time elapsed: 0.022 s
% 0.60/0.77 % (2914)Instructions burned: 34 (million)
% 0.60/0.77 % (2914)------------------------------
% 0.60/0.77 % (2914)------------------------------
% 0.60/0.77 % (2916)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2913"
% 0.60/0.77 % (2916)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for theBenchmark
% 0.60/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.77 % (2916)------------------------------
% 0.60/0.77 % (2916)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (2916)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (2916)Memory used [KB]: 1416
% 0.60/0.77 % (2916)Time elapsed: 0.023 s
% 0.60/0.77 % (2916)Instructions burned: 34 (million)
% 0.60/0.77 % (2913)Success in time 0.398 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------