TSTP Solution File: SWC185+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC185+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 : n024.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 : Wed May 1 04:00:24 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 11 unt; 1 typ; 0 def)
% Number of atoms : 661 ( 68 equ)
% Maximal formula atoms : 36 ( 14 avg)
% Number of connectives : 445 ( 141 ~; 120 |; 153 &)
% ( 3 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 312 ( 312 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 11 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 151 ( 78 !; 72 ?; 25 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ13_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f266,plain,
$false,
inference(avatar_sat_refutation,[],[f238,f258,f265]) ).
tff(f265,plain,
~ spl14_2,
inference(avatar_contradiction_clause,[],[f264]) ).
tff(f264,plain,
( $false
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f263,f156]) ).
tff(f156,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f130]) ).
tff(f130,plain,
( ( memberP(sK6,sK4)
| memberP(sK5,sK4) )
& ( sK0 = app(app(sK5,cons(sK4,nil)),sK6) )
& ssList(sK6)
& ssList(sK5)
& ssItem(sK4)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( 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])],[f100,f129,f128,f127,f126,f125,f124,f123]) ).
tff(f123,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f124,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f125,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f126,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f127,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = sK0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ( memberP(X6,sK4)
| memberP(X5,sK4) )
& ( sK0 = app(app(X5,cons(sK4,nil)),X6) )
& ssList(X6) )
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f128,plain,
( ? [X5] :
( ? [X6] :
( ( memberP(X6,sK4)
| memberP(X5,sK4) )
& ( sK0 = app(app(X5,cons(sK4,nil)),X6) )
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ( memberP(X6,sK4)
| memberP(sK5,sK4) )
& ( sK0 = app(app(sK5,cons(sK4,nil)),X6) )
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f129,plain,
( ? [X6] :
( ( memberP(X6,sK4)
| memberP(sK5,sK4) )
& ( sK0 = app(app(sK5,cons(sK4,nil)),X6) )
& ssList(X6) )
=> ( ( memberP(sK6,sK4)
| memberP(sK5,sK4) )
& ( sK0 = app(app(sK5,cons(sK4,nil)),sK6) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
tff(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X2 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ( ~ memberP(X6,X4)
& ~ memberP(X5,X4) )
| ( app(app(X5,cons(X4,nil)),X6) != X0 ) ) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ( memberP(X9,X7)
| memberP(X8,X7) )
& ( app(app(X8,cons(X7,nil)),X9) = X2 )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( ~ memberP(X9,X7)
& ~ memberP(X8,X7) )
| ( app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& ( app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XXFx5mqYI8/Vampire---4.8_25008',co1) ).
tff(f263,plain,
( ~ ssItem(sK4)
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f262,f157]) ).
tff(f157,plain,
ssList(sK5),
inference(cnf_transformation,[],[f130]) ).
tff(f262,plain,
( ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f261,f158]) ).
tff(f158,plain,
ssList(sK6),
inference(cnf_transformation,[],[f130]) ).
tff(f261,plain,
( ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f259,f237]) ).
tff(f237,plain,
( memberP(sK6,sK4)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f235]) ).
tff(f235,plain,
( spl14_2
<=> memberP(sK6,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
tff(f259,plain,
( ~ memberP(sK6,sK4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(resolution,[],[f250,f203]) ).
tff(f203,plain,
sQ13_eqProxy($i,sK2,app(app(sK5,cons(sK4,nil)),sK6)),
inference(equality_proxy_replacement,[],[f195,f202]) ).
tff(f202,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ13_eqProxy])]) ).
tff(f195,plain,
sK2 = app(app(sK5,cons(sK4,nil)),sK6),
inference(definition_unfolding,[],[f159,f153]) ).
tff(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
tff(f159,plain,
sK0 = app(app(sK5,cons(sK4,nil)),sK6),
inference(cnf_transformation,[],[f130]) ).
tff(f250,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ sQ13_eqProxy($i,sK2,app(app(X0,cons(X1,nil)),X2))
| ~ memberP(X2,X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(resolution,[],[f227,f204]) ).
tff(f204,plain,
! [X8: $i,X9: $i,X7: $i] :
( ~ sQ13_eqProxy($i,app(app(X8,cons(X7,nil)),X9),sK2)
| ~ memberP(X9,X7)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7) ),
inference(equality_proxy_replacement,[],[f155,f202]) ).
tff(f155,plain,
! [X8: $i,X9: $i,X7: $i] :
( ~ memberP(X9,X7)
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f130]) ).
tff(f227,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X2,X1)
| ~ sQ13_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f202]) ).
tff(f258,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f257,f231]) ).
tff(f231,plain,
( spl14_1
<=> memberP(sK5,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
tff(f257,plain,
~ memberP(sK5,sK4),
inference(subsumption_resolution,[],[f256,f156]) ).
tff(f256,plain,
( ~ memberP(sK5,sK4)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f255,f157]) ).
tff(f255,plain,
( ~ memberP(sK5,sK4)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f253,f158]) ).
tff(f253,plain,
( ~ memberP(sK5,sK4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(resolution,[],[f249,f203]) ).
tff(f249,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ sQ13_eqProxy($i,sK2,app(app(X0,cons(X1,nil)),X2))
| ~ memberP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(resolution,[],[f227,f205]) ).
tff(f205,plain,
! [X8: $i,X9: $i,X7: $i] :
( ~ sQ13_eqProxy($i,app(app(X8,cons(X7,nil)),X9),sK2)
| ~ memberP(X8,X7)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7) ),
inference(equality_proxy_replacement,[],[f154,f202]) ).
tff(f154,plain,
! [X8: $i,X9: $i,X7: $i] :
( ~ memberP(X8,X7)
| ( app(app(X8,cons(X7,nil)),X9) != sK2 )
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f130]) ).
tff(f238,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f160,f235,f231]) ).
tff(f160,plain,
( memberP(sK6,sK4)
| memberP(sK5,sK4) ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC185+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 18:15:51 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.XXFx5mqYI8/Vampire---4.8_25008
% 0.57/0.75 % (25122)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.57/0.75 % (25116)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.57/0.75 % (25118)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.57/0.75 % (25119)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.57/0.75 % (25117)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.57/0.75 % (25120)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.57/0.75 % (25121)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.57/0.75 % (25116)First to succeed.
% 0.57/0.76 % (25118)Also succeeded, but the first one will report.
% 0.57/0.76 % (25116)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (25116)------------------------------
% 0.57/0.76 % (25116)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (25116)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (25116)Memory used [KB]: 1160
% 0.57/0.76 % (25116)Time elapsed: 0.006 s
% 0.57/0.76 % (25116)Instructions burned: 8 (million)
% 0.57/0.76 % (25116)------------------------------
% 0.57/0.76 % (25116)------------------------------
% 0.57/0.76 % (25115)Success in time 0.385 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------