TSTP Solution File: LCL674+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL674+1.001 : TPTP v8.2.0. Released v4.0.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 : 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 00:21:17 EDT 2024
% Result : Theorem 0.70s 0.90s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 7 unt; 0 def)
% Number of atoms : 477 ( 0 equ)
% Maximal formula atoms : 52 ( 11 avg)
% Number of connectives : 775 ( 339 ~; 270 |; 161 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 116 ( 94 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f80,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f74,f79]) ).
fof(f79,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| ~ spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f77,f47]) ).
fof(f47,plain,
( sP0(sK3)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f46,plain,
( spl4_1
<=> sP0(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f77,plain,
( ~ sP0(sK3)
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f76,f36]) ).
fof(f36,plain,
p100(sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( p100(sK3)
& ~ p101(sK3)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(sK3,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(sK3,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f19,f20]) ).
fof(f20,plain,
( ? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) )
=> ( p100(sK3)
& ~ p101(sK3)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(sK3,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(sK3,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(definition_folding,[],[f9,f12]) ).
fof(f12,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f9,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f76,plain,
( ~ p100(sK3)
| ~ sP0(sK3)
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f75,f35]) ).
fof(f35,plain,
~ p101(sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f75,plain,
( p101(sK3)
| ~ p100(sK3)
| ~ sP0(sK3)
| ~ spl4_2 ),
inference(resolution,[],[f52,f23]) ).
fof(f23,plain,
! [X0] :
( ~ p2(sK2(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ( p101(sK1(X0))
& p2(sK1(X0))
& r1(X0,sK1(X0))
& p101(sK2(X0))
& ~ p2(sK2(X0))
& r1(X0,sK2(X0)) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f15,f17,f16]) ).
fof(f16,plain,
! [X0] :
( ? [X1] :
( p101(X1)
& p2(X1)
& r1(X0,X1) )
=> ( p101(sK1(X0))
& p2(sK1(X0))
& r1(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0] :
( ? [X2] :
( p101(X2)
& ~ p2(X2)
& r1(X0,X2) )
=> ( p101(sK2(X0))
& ~ p2(sK2(X0))
& r1(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ( ? [X1] :
( p101(X1)
& p2(X1)
& r1(X0,X1) )
& ? [X2] :
( p101(X2)
& ~ p2(X2)
& r1(X0,X2) ) )
| ~ sP0(X0) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f12]) ).
fof(f52,plain,
( p2(sK2(sK3))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl4_2
<=> p2(sK2(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f74,plain,
spl4_1,
inference(avatar_split_clause,[],[f54,f46]) ).
fof(f54,plain,
sP0(sK3),
inference(resolution,[],[f29,f38]) ).
fof(f38,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f29,plain,
! [X1] :
( ~ r1(sK3,X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f53,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f44,f50,f46]) ).
fof(f44,plain,
( p2(sK2(sK3))
| ~ sP0(sK3) ),
inference(subsumption_resolution,[],[f43,f36]) ).
fof(f43,plain,
( p2(sK2(sK3))
| ~ p100(sK3)
| ~ sP0(sK3) ),
inference(subsumption_resolution,[],[f42,f35]) ).
fof(f42,plain,
( p2(sK2(sK3))
| p101(sK3)
| ~ p100(sK3)
| ~ sP0(sK3) ),
inference(resolution,[],[f28,f22]) ).
fof(f22,plain,
! [X0] :
( r1(X0,sK2(X0))
| p101(X0)
| ~ p100(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X6] :
( ~ r1(sK3,X6)
| p2(X6) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL674+1.001 : TPTP v8.2.0. Released v4.0.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.39 % Computer : n018.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Mon May 20 03:21:53 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.15/0.39 This is a FOF_THM_RFO_NEQ problem
% 0.15/0.39 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/benchmark/theBenchmark.p
% 0.70/0.90 % (6309)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 (2994ds/34Mi)
% 0.70/0.90 % (6307)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.70/0.90 % (6310)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.70/0.90 % (6308)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.70/0.90 % (6305)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 (2994ds/34Mi)
% 0.70/0.90 % (6311)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 (2994ds/83Mi)
% 0.70/0.90 % (6312)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 (2994ds/56Mi)
% 0.70/0.90 % (6306)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 (2994ds/51Mi)
% 0.70/0.90 % (6310)First to succeed.
% 0.70/0.90 % (6309)Also succeeded, but the first one will report.
% 0.70/0.90 % (6311)Also succeeded, but the first one will report.
% 0.70/0.90 % (6307)Also succeeded, but the first one will report.
% 0.70/0.90 % (6305)Also succeeded, but the first one will report.
% 0.70/0.90 % (6312)Also succeeded, but the first one will report.
% 0.70/0.90 % (6308)Also succeeded, but the first one will report.
% 0.70/0.90 % (6310)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6304"
% 0.70/0.90 % (6306)Also succeeded, but the first one will report.
% 0.70/0.90 % (6310)Refutation found. Thanks to Tanya!
% 0.70/0.90 % SZS status Theorem for theBenchmark
% 0.70/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.90 % (6310)------------------------------
% 0.70/0.90 % (6310)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.90 % (6310)Termination reason: Refutation
% 0.70/0.90
% 0.70/0.90 % (6310)Memory used [KB]: 991
% 0.70/0.90 % (6310)Time elapsed: 0.005 s
% 0.70/0.90 % (6310)Instructions burned: 5 (million)
% 0.70/0.90 % (6304)Success in time 0.507 s
% 0.70/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------