TSTP Solution File: SWC101+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC101+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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:35 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 55 ( 11 unt; 0 def)
% Number of atoms : 393 ( 152 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 530 ( 192 ~; 159 |; 151 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 123 ( 77 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f318,plain,
$false,
inference(avatar_sat_refutation,[],[f250,f259,f260,f301,f317]) ).
fof(f317,plain,
( spl14_1
| spl14_4 ),
inference(avatar_contradiction_clause,[],[f316]) ).
fof(f316,plain,
( $false
| spl14_1
| spl14_4 ),
inference(subsumption_resolution,[],[f315,f166]) ).
fof(f166,plain,
ssList(sK2),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK2
| nil = sK3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f138,f137,f136,f135,f134]) ).
fof(f134,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KOaciM085P/Vampire---4.8_12598',co1) ).
fof(f315,plain,
( ~ ssList(sK2)
| spl14_1
| spl14_4 ),
inference(subsumption_resolution,[],[f314,f203]) ).
fof(f203,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.KOaciM085P/Vampire---4.8_12598',ax17) ).
fof(f314,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| spl14_1
| spl14_4 ),
inference(subsumption_resolution,[],[f303,f258]) ).
fof(f258,plain,
( nil != sK2
| spl14_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl14_4
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f303,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl14_1 ),
inference(resolution,[],[f245,f200]) ).
fof(f200,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,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/sandbox2/tmp/tmp.KOaciM085P/Vampire---4.8_12598',ax15) ).
fof(f245,plain,
( ~ neq(sK2,nil)
| spl14_1 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f243,plain,
( spl14_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f301,plain,
spl14_2,
inference(avatar_split_clause,[],[f300,f247]) ).
fof(f247,plain,
( spl14_2
<=> frontsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f300,plain,
frontsegP(sK3,sK2),
inference(subsumption_resolution,[],[f299,f167]) ).
fof(f167,plain,
ssList(sK3),
inference(cnf_transformation,[],[f139]) ).
fof(f299,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f298,f166]) ).
fof(f298,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f273,f170]) ).
fof(f170,plain,
ssList(sK4),
inference(cnf_transformation,[],[f139]) ).
fof(f273,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f236,f171]) ).
fof(f171,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f139]) ).
fof(f236,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f216]) ).
fof(f216,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f154,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KOaciM085P/Vampire---4.8_12598',ax5) ).
fof(f260,plain,
( spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f174,f256,f252]) ).
fof(f252,plain,
( spl14_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f174,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f139]) ).
fof(f259,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f227,f256,f252]) ).
fof(f227,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f175,f169,f168]) ).
fof(f168,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f139]) ).
fof(f169,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f139]) ).
fof(f175,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f139]) ).
fof(f250,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f226,f247,f243]) ).
fof(f226,plain,
( ~ frontsegP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f176,f168,f169,f169]) ).
fof(f176,plain,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f139]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC101+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n021.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:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.KOaciM085P/Vampire---4.8_12598
% 0.60/0.77 % (12770)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.77 % (12772)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.77 % (12773)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.77 % (12774)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.77 % (12771)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.77 % (12775)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.77 % (12777)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 % (12776)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.78 % (12775)First to succeed.
% 0.60/0.78 % (12772)Also succeeded, but the first one will report.
% 0.60/0.78 % (12775)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12769"
% 0.60/0.78 % (12775)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 % (12775)------------------------------
% 0.60/0.78 % (12775)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (12775)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (12775)Memory used [KB]: 1175
% 0.60/0.78 % (12775)Time elapsed: 0.007 s
% 0.60/0.78 % (12775)Instructions burned: 9 (million)
% 0.60/0.78 % (12769)Success in time 0.395 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------