TSTP Solution File: SWV403+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV403+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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 10:51:41 EDT 2024
% Result : Theorem 5.33s 1.12s
% Output : Refutation 5.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 6 unt; 0 def)
% Number of atoms : 223 ( 35 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 239 ( 91 ~; 94 |; 38 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 173 ( 139 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5492,plain,
$false,
inference(avatar_sat_refutation,[],[f405,f5455,f5459,f5468,f5482,f5491]) ).
fof(f5491,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f5490]) ).
fof(f5490,plain,
( $false
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f5489,f43]) ).
fof(f43,plain,
strictly_less_than(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3)
& strictly_less_than(sK2,sK3)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2)
& ! [X6,X7,X8] :
( pair_in_list(update_slb(sK0,X8),X6,X8)
| ~ strictly_less_than(X7,X8)
| ~ pair_in_list(sK0,X6,X7) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f31,f33,f32]) ).
fof(f32,plain,
( ? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X8)
| ~ strictly_less_than(X7,X8)
| ~ pair_in_list(X0,X6,X7) ) )
=> ( ? [X5,X4,X3,X2,X1] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(X4,X5)),X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(insert_slb(sK0,pair(X4,X5)),X1,X2) )
& ! [X8,X7,X6] :
( pair_in_list(update_slb(sK0,X8),X6,X8)
| ~ strictly_less_than(X7,X8)
| ~ pair_in_list(sK0,X6,X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
( ? [X5,X4,X3,X2,X1] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(X4,X5)),X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(insert_slb(sK0,pair(X4,X5)),X1,X2) )
=> ( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3)
& strictly_less_than(sK2,sK3)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X8)
| ~ strictly_less_than(X7,X8)
| ~ pair_in_list(X0,X6,X7) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& strictly_less_than(X5,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6)
& strictly_less_than(X5,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( strictly_less_than(X5,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) )
=> ! [X4,X5,X6,X7,X8] :
( ( strictly_less_than(X5,X6)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l39_co) ).
fof(f5489,plain,
( ~ strictly_less_than(sK2,sK3)
| ~ spl6_2
| ~ spl6_3 ),
inference(resolution,[],[f5486,f5466]) ).
fof(f5466,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| ~ spl6_3 ),
inference(resolution,[],[f5464,f68]) ).
fof(f68,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax23) ).
fof(f5464,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK3)
| ~ spl6_3 ),
inference(superposition,[],[f44,f5450]) ).
fof(f5450,plain,
( ! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK5)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK5))
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f5449]) ).
fof(f5449,plain,
( spl6_3
<=> ! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK5)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f44,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f5486,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,X0)
| ~ strictly_less_than(sK2,X0) )
| ~ spl6_2 ),
inference(resolution,[],[f404,f41]) ).
fof(f41,plain,
! [X8,X6,X7] :
( ~ pair_in_list(sK0,X6,X7)
| ~ strictly_less_than(X7,X8)
| pair_in_list(update_slb(sK0,X8),X6,X8) ),
inference(cnf_transformation,[],[f34]) ).
fof(f404,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f402]) ).
fof(f402,plain,
( spl6_2
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f5482,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f5481]) ).
fof(f5481,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(subsumption_resolution,[],[f5480,f72]) ).
fof(f72,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f71]) ).
fof(f71,plain,
! [X2,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X4)),X2,X4)
| X1 != X2 ),
inference(equality_resolution,[],[f69]) ).
fof(f69,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 != X4
| X1 != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f5480,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK3)),sK1,sK3)
| ~ spl6_1
| spl6_2 ),
inference(forward_demodulation,[],[f5479,f400]) ).
fof(f400,plain,
( sK1 = sK4
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f398]) ).
fof(f398,plain,
( spl6_1
<=> sK1 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f5479,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| spl6_2 ),
inference(forward_demodulation,[],[f5476,f761]) ).
fof(f761,plain,
! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK2)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK3)),
inference(resolution,[],[f59,f43]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax29) ).
fof(f5476,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK2)),sK3),sK1,sK3)
| spl6_2 ),
inference(superposition,[],[f44,f5473]) ).
fof(f5473,plain,
( sK2 = sK5
| spl6_2 ),
inference(subsumption_resolution,[],[f597,f403]) ).
fof(f403,plain,
( ~ pair_in_list(sK0,sK1,sK2)
| spl6_2 ),
inference(avatar_component_clause,[],[f402]) ).
fof(f597,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f67,f42]) ).
fof(f42,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f34]) ).
fof(f67,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X3 = X4 ),
inference(cnf_transformation,[],[f40]) ).
fof(f5468,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f5467]) ).
fof(f5467,plain,
( $false
| spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f5466,f5462]) ).
fof(f5462,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| spl6_1
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f5461,f399]) ).
fof(f399,plain,
( sK1 != sK4
| spl6_1 ),
inference(avatar_component_clause,[],[f398]) ).
fof(f5461,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| sK1 = sK4
| ~ spl6_4 ),
inference(resolution,[],[f5453,f66]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X1 = X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f5453,plain,
( pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f5452]) ).
fof(f5452,plain,
( spl6_4
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f5459,plain,
( ~ spl6_2
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f5458]) ).
fof(f5458,plain,
( $false
| ~ spl6_2
| spl6_4 ),
inference(subsumption_resolution,[],[f5457,f43]) ).
fof(f5457,plain,
( ~ strictly_less_than(sK2,sK3)
| ~ spl6_2
| spl6_4 ),
inference(resolution,[],[f5456,f406]) ).
fof(f406,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,X0)
| ~ strictly_less_than(sK2,X0) )
| ~ spl6_2 ),
inference(resolution,[],[f404,f41]) ).
fof(f5456,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
| spl6_4 ),
inference(resolution,[],[f5454,f68]) ).
fof(f5454,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| spl6_4 ),
inference(avatar_component_clause,[],[f5452]) ).
fof(f5455,plain,
( spl6_3
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f3270,f5452,f5449]) ).
fof(f3270,plain,
! [X0,X1] :
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK3)
| update_slb(insert_slb(X0,pair(X1,sK5)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK5)) ),
inference(superposition,[],[f44,f1285]) ).
fof(f1285,plain,
! [X2,X3,X0,X1,X4,X5] :
( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
| update_slb(insert_slb(X4,pair(X5,X2)),X3) = insert_slb(update_slb(X4,X3),pair(X5,X2)) ),
inference(resolution,[],[f762,f60]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( ~ less_than(X2,X3)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax30) ).
fof(f762,plain,
! [X2,X3,X0,X1] :
( less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3)) ),
inference(resolution,[],[f59,f78]) ).
fof(f78,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(subsumption_resolution,[],[f54,f51]) ).
fof(f51,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f54,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) )
& ( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
| ~ strictly_less_than(X0,X1) ) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) )
& ( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
| ~ strictly_less_than(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f405,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f394,f402,f398]) ).
fof(f394,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f66,f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV403+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 20:58:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 % (29736)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.35 % (29739)WARNING: value z3 for option sas not known
% 0.11/0.35 % (29739)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.35 % (29741)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.11/0.35 % (29740)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.35 % (29737)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.35 % (29738)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.35 % (29743)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.11/0.35 % (29742)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.11/0.35 TRYING [1]
% 0.11/0.35 TRYING [2]
% 0.11/0.36 TRYING [3]
% 0.11/0.36 TRYING [1]
% 0.11/0.36 TRYING [2]
% 0.11/0.37 TRYING [4]
% 0.11/0.38 TRYING [3]
% 0.17/0.41 TRYING [5]
% 0.17/0.43 TRYING [4]
% 0.17/0.54 TRYING [6]
% 2.82/0.74 TRYING [5]
% 3.24/0.84 TRYING [7]
% 3.74/0.87 TRYING [1]
% 3.74/0.87 TRYING [2]
% 3.87/0.87 TRYING [3]
% 3.87/0.89 TRYING [4]
% 4.16/0.94 TRYING [5]
% 5.33/1.09 TRYING [6]
% 5.33/1.11 % (29739)First to succeed.
% 5.33/1.12 % (29739)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29736"
% 5.33/1.12 % (29739)Refutation found. Thanks to Tanya!
% 5.33/1.12 % SZS status Theorem for theBenchmark
% 5.33/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 5.33/1.12 % (29739)------------------------------
% 5.33/1.12 % (29739)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.33/1.12 % (29739)Termination reason: Refutation
% 5.33/1.12
% 5.33/1.12 % (29739)Memory used [KB]: 2543
% 5.33/1.12 % (29739)Time elapsed: 0.769 s
% 5.33/1.12 % (29739)Instructions burned: 1856 (million)
% 5.33/1.12 % (29736)Success in time 0.773 s
%------------------------------------------------------------------------------