%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP775+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:16:10 AM UTC 2026
% Result : Theorem 3.32s 1.35s
% Output : Refutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 95 ( 14 unt; 3 def)
% Number of atoms : 272 ( 111 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 314 ( 137 ~; 142 |; 26 &)
% ( 8 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn 85 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] : product(product(X2,X1),X0) = product(X2,product(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos01) ).
fof(f2,axiom,
! [X0] : product(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos02) ).
fof(f3,axiom,
! [X0,X1] :
( l(X0,X1)
<=> ( product(X0,X1) = X0
& product(X1,X0) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos03) ).
fof(f4,axiom,
! [X0,X1] :
( r(X0,X1)
<=> ( product(X0,X1) = X1
& product(X1,X0) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos04) ).
fof(f5,axiom,
! [X0,X1] :
( d(X0,X1)
<=> ? [X2] :
( r(X0,X2)
& l(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos05) ).
fof(f6,conjecture,
! [X0,X1] :
( d(X0,X1)
<=> ( product(X0,product(X1,X0)) = X0
& product(X1,product(X0,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
( d(X0,X1)
<=> ( product(X0,product(X1,X0)) = X0
& product(X1,product(X0,X1)) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
? [X0,X1] :
( d(X0,X1)
<~> ( product(X0,product(X1,X0)) = X0
& product(X1,product(X0,X1)) = X1 ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ( l(X0,X1)
| product(X0,X1) != X0
| product(X1,X0) != X1 )
& ( ( product(X0,X1) = X0
& product(X1,X0) = X1 )
| ~ l(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1] :
( ( l(X0,X1)
| product(X0,X1) != X0
| product(X1,X0) != X1 )
& ( ( product(X0,X1) = X0
& product(X1,X0) = X1 )
| ~ l(X0,X1) ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ( r(X0,X1)
| product(X0,X1) != X1
| product(X1,X0) != X0 )
& ( ( product(X0,X1) = X1
& product(X1,X0) = X0 )
| ~ r(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0,X1] :
( ( r(X0,X1)
| product(X0,X1) != X1
| product(X1,X0) != X0 )
& ( ( product(X0,X1) = X1
& product(X1,X0) = X0 )
| ~ r(X0,X1) ) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ( d(X0,X1)
| ! [X2] :
( ~ r(X0,X2)
| ~ l(X2,X1) ) )
& ( ? [X2] :
( r(X0,X2)
& l(X2,X1) )
| ~ d(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f14,plain,
! [X0,X1] :
( ( d(X0,X1)
| ! [X2] :
( ~ r(X0,X2)
| ~ l(X2,X1) ) )
& ( ? [X3] :
( r(X0,X3)
& l(X3,X1) )
| ~ d(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( d(X0,X1)
| ! [X2] :
( ~ r(X0,X2)
| ~ l(X2,X1) ) )
& ( ( r(X0,sK0(X0,X1))
& l(sK0(X0,X1),X1) )
| ~ d(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f14]) ).
fof(f16,plain,
? [X0,X1] :
( ( product(X0,product(X1,X0)) != X0
| product(X1,product(X0,X1)) != X1
| ~ d(X0,X1) )
& ( ( product(X0,product(X1,X0)) = X0
& product(X1,product(X0,X1)) = X1 )
| d(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f17,plain,
? [X0,X1] :
( ( product(X0,product(X1,X0)) != X0
| product(X1,product(X0,X1)) != X1
| ~ d(X0,X1) )
& ( ( product(X0,product(X1,X0)) = X0
& product(X1,product(X0,X1)) = X1 )
| d(X0,X1) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
( ( sK1 != product(sK1,product(sK2,sK1))
| sK2 != product(sK2,product(sK1,sK2))
| ~ d(sK1,sK2) )
& ( ( sK1 = product(sK1,product(sK2,sK1))
& sK2 = product(sK2,product(sK1,sK2)) )
| d(sK1,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f17]) ).
fof(f19,plain,
! [X2,X0,X1] : product(product(X2,X1),X0) = product(X2,product(X1,X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X0] : product(X0,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( ~ l(X0,X1)
| product(X1,X0) = X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f22,plain,
! [X0,X1] :
( ~ l(X0,X1)
| product(X0,X1) = X0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( l(X0,X1)
| product(X0,X1) != X0
| product(X1,X0) != X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ r(X0,X1)
| product(X1,X0) = X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X0,X1] :
( ~ r(X0,X1)
| product(X0,X1) = X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0,X1] :
( r(X0,X1)
| product(X0,X1) != X1
| product(X1,X0) != X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f27,plain,
! [X0,X1] :
( ~ d(X0,X1)
| l(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
! [X0,X1] :
( ~ d(X0,X1)
| r(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ r(X0,X2)
| d(X0,X1)
| ~ l(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
( sK2 = product(sK2,product(sK1,sK2))
| d(sK1,sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
( sK1 = product(sK1,product(sK2,sK1))
| d(sK1,sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
( sK1 != product(sK1,product(sK2,sK1))
| sK2 != product(sK2,product(sK1,sK2))
| ~ d(sK1,sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,definition,
( spl3_1
<=> d(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f35,plain,
( ~ d(sK1,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f36,plain,
( d(sK1,sK2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f38,definition,
( spl3_2
<=> sK2 = product(sK2,product(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f39,plain,
( sK2 != product(sK2,product(sK1,sK2))
| spl3_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f40,plain,
( sK2 = product(sK2,product(sK1,sK2))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f30,f38,f34]) ).
fof(f43,definition,
( spl3_3
<=> sK1 = product(sK1,product(sK2,sK1)) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f44,plain,
( sK1 != product(sK1,product(sK2,sK1))
| spl3_3 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f45,plain,
( sK1 = product(sK1,product(sK2,sK1))
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f46,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f31,f43,f34]) ).
fof(f47,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f32,f43,f38,f34]) ).
fof(f50,plain,
! [X0,X1] : product(X0,X1) = product(X0,product(X0,X1)),
inference(superposition,[],[f19,f20]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ l(X1,X2)
| product(X1,X0) != X0
| d(X0,X2)
| product(X0,X1) != X1 ),
inference(resolution,[],[f26,f29]) ).
fof(f86,plain,
! [X2,X0,X1] : product(product(X0,X1),X2) = product(X0,product(X1,product(product(X0,X1),X2))),
inference(superposition,[],[f19,f50]) ).
fof(f89,plain,
! [X2,X0,X1] : product(X0,product(X1,X2)) = product(X0,product(X1,product(X0,product(X1,X2)))),
inference(forward_demodulation,[],[f86,f19]) ).
fof(f128,plain,
! [X2,X0,X1] :
( d(X1,X2)
| product(X0,X1) != X1
| product(X1,X0) != X0
| product(X0,X2) != X0
| product(X2,X0) != X2 ),
inference(resolution,[],[f74,f23]) ).
fof(f155,plain,
! [X2,X3,X0,X1] : product(product(X0,X1),product(X2,X3)) = product(X0,product(X1,product(X2,product(product(X0,X1),product(X2,X3))))),
inference(superposition,[],[f19,f89]) ).
fof(f158,plain,
! [X2,X3,X0,X1] : product(X0,product(X1,product(X2,X3))) = product(X0,product(X1,product(X2,product(X0,product(X1,product(X2,X3)))))),
inference(forward_demodulation,[],[f155,f19]) ).
fof(f458,plain,
( ! [X0] :
( sK1 != product(X0,sK1)
| product(sK1,X0) != X0
| product(X0,sK2) != X0
| sK2 != product(sK2,X0) )
| spl3_1 ),
inference(resolution,[],[f128,f35]) ).
fof(f529,plain,
( ! [X0,X1] :
( sK1 != product(X0,product(X1,sK1))
| product(X0,X1) != product(sK1,product(X0,X1))
| product(X0,X1) != product(product(X0,X1),sK2)
| sK2 != product(sK2,product(X0,X1)) )
| spl3_1 ),
inference(superposition,[],[f458,f19]) ).
fof(f532,plain,
( ! [X0,X1] :
( sK1 != product(X0,product(X1,sK1))
| product(X0,X1) != product(X0,product(X1,sK2))
| product(X0,X1) != product(sK1,product(X0,X1))
| sK2 != product(sK2,product(X0,X1)) )
| spl3_1 ),
inference(forward_demodulation,[],[f529,f19]) ).
fof(f557,plain,
( ! [X0] : product(X0,sK2) = product(X0,product(sK2,product(sK1,product(X0,sK2))))
| ~ spl3_2 ),
inference(superposition,[],[f158,f40]) ).
fof(f2820,plain,
( sK1 != sK1
| product(sK1,sK2) != product(sK1,product(sK2,sK2))
| product(sK1,sK2) != product(sK1,product(sK1,sK2))
| sK2 != product(sK2,product(sK1,sK2))
| spl3_1
| ~ spl3_3 ),
inference(superposition,[],[f532,f45]) ).
fof(f2824,plain,
( product(sK1,sK2) != product(sK1,product(sK2,sK2))
| product(sK1,sK2) != product(sK1,product(sK1,sK2))
| sK2 != product(sK2,product(sK1,sK2))
| spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f2820]) ).
fof(f2828,plain,
( product(sK1,sK2) != product(sK1,product(sK2,sK2))
| sK2 != product(sK2,product(sK1,sK2))
| spl3_1
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f2824,f50]) ).
fof(f2833,plain,
( product(sK1,sK2) != product(sK1,product(sK2,sK2))
| spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f2828,f40]) ).
fof(f2837,plain,
( product(sK1,sK2) != product(sK1,sK2)
| spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_demodulation,[],[f2833,f20]) ).
fof(f2838,plain,
( $false
| spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f2837]) ).
fof(f2839,plain,
( spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f2838]) ).
fof(f2844,plain,
( r(sK1,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(resolution,[],[f36,f28]) ).
fof(f2845,plain,
( l(sK0(sK1,sK2),sK2)
| ~ spl3_1 ),
inference(resolution,[],[f36,f27]) ).
fof(f2847,plain,
( sK0(sK1,sK2) = product(sK1,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(resolution,[],[f2844,f25]) ).
fof(f2848,plain,
( sK1 = product(sK0(sK1,sK2),sK1)
| ~ spl3_1 ),
inference(resolution,[],[f2844,f24]) ).
fof(f2850,plain,
( sK0(sK1,sK2) = product(sK0(sK1,sK2),sK2)
| ~ spl3_1 ),
inference(resolution,[],[f2845,f22]) ).
fof(f2851,plain,
( sK2 = product(sK2,sK0(sK1,sK2))
| ~ spl3_1 ),
inference(resolution,[],[f2845,f21]) ).
fof(f2852,plain,
( ! [X0] : product(sK1,X0) = product(sK0(sK1,sK2),product(sK1,X0))
| ~ spl3_1 ),
inference(superposition,[],[f19,f2848]) ).
fof(f2882,plain,
( ! [X0] : product(X0,sK0(sK1,sK2)) = product(X0,product(sK1,product(X0,sK0(sK1,sK2))))
| ~ spl3_1 ),
inference(superposition,[],[f89,f2847]) ).
fof(f2893,plain,
( ! [X0] : product(sK0(sK1,sK2),X0) = product(sK0(sK1,sK2),product(sK2,X0))
| ~ spl3_1 ),
inference(superposition,[],[f19,f2850]) ).
fof(f3272,plain,
( product(sK0(sK1,sK2),product(sK2,sK2)) = product(sK0(sK1,sK2),product(sK2,product(sK1,product(sK2,sK2))))
| ~ spl3_1
| ~ spl3_2 ),
inference(superposition,[],[f2893,f557]) ).
fof(f3350,plain,
( product(sK0(sK1,sK2),product(sK1,product(sK2,sK2))) = product(sK0(sK1,sK2),product(sK2,sK2))
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3272,f2893]) ).
fof(f3371,plain,
( product(sK0(sK1,sK2),sK2) = product(sK0(sK1,sK2),product(sK1,product(sK2,sK2)))
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3350,f2893]) ).
fof(f3375,plain,
( product(sK1,product(sK2,sK2)) = product(sK0(sK1,sK2),sK2)
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3371,f2852]) ).
fof(f3378,plain,
( product(sK1,product(sK2,sK2)) = sK0(sK1,sK2)
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3375,f2850]) ).
fof(f3380,plain,
( product(sK1,sK2) = sK0(sK1,sK2)
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3378,f20]) ).
fof(f3384,plain,
( sK1 = product(product(sK1,sK2),sK1)
| ~ spl3_1
| ~ spl3_2 ),
inference(superposition,[],[f2848,f3380]) ).
fof(f3416,plain,
( sK1 = product(sK1,product(sK2,sK1))
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3384,f19]) ).
fof(f3420,plain,
( $false
| ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(forward_subsumption_resolution,[],[f3416,f44]) ).
fof(f3421,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f3420]) ).
fof(f3434,plain,
( sK2 = product(sK2,product(sK1,sK2))
| ~ spl3_1 ),
inference(superposition,[],[f2882,f2851]) ).
fof(f3479,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f3434,f39]) ).
fof(f3480,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f3479]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f41]) ).
cnf(s2,plain,
( spl3_1
| spl3_3 ),
inference(sat_conversion,[],[f46]) ).
cnf(s3,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f47]) ).
cnf(s5,plain,
( spl3_1
| ~ spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f2839]) ).
cnf(s11,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f3421]) ).
cnf(s12,plain,
( ~ spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f3480]) ).
cnf(s13,plain,
spl3_1,
inference(rat,[],[s5,s1,s2]) ).
cnf(s14,plain,
spl3_2,
inference(rat,[],[s12,s13]) ).
cnf(s17,plain,
spl3_3,
inference(rat,[],[s11,s14,s13]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s3,s14,s13,s17]) ).
fof(f3490,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP775+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 10:46:08 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.32/1.35 % (2148244)Detected formulas, will run a generic FOF schedule.
% 3.32/1.35 % (2148249)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=166485609:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.32/1.35 % (2148255)dis-21_1_sil=8000:lcm=predicate:random_seed=2791981168:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.32/1.35 % (2148251)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3845074314:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.32/1.35 % (2148250)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1890110789:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.32/1.35 % (2148253)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4036498857:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.32/1.35 % (2148252)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3206350292:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.32/1.35 % (2148254)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3016530315:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.32/1.35 % (2148252)Refutation not found, incomplete strategy
% 3.32/1.35 % (2148252)------------------------------
% 3.32/1.35 % (2148252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.32/1.35 % (2148252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.32/1.35 % (2148252)CaDiCaL version: 2.1.3
% 3.32/1.35 % (2148252)Termination reason: Refutation not found, incomplete strategy
% 3.32/1.35 % (2148252)Time elapsed: 0.002 s
% 3.32/1.35 % (2148252)Peak memory usage: 88 MB
% 3.32/1.35 % (2148252)Instructions burned: 1 (million)
% 3.32/1.35 % (2148255)Refutation not found, incomplete strategy
% 3.32/1.35 % (2148255)------------------------------
% 3.32/1.35 % (2148255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.32/1.35 % (2148255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.32/1.35 % (2148255)CaDiCaL version: 2.1.3
% 3.32/1.35 % (2148255)Termination reason: Refutation not found, incomplete strategy
% 3.32/1.35 % (2148255)Time elapsed: 0.003 s
% 3.32/1.35 % (2148255)Peak memory usage: 88 MB
% 3.32/1.35 % (2148255)Instructions burned: 2 (million)
% 3.32/1.35 % (2148253)Instruction limit reached!
% 3.32/1.35 % (2148253)------------------------------
% 3.32/1.35 % (2148253)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.32/1.35 % (2148253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.32/1.35 % (2148253)CaDiCaL version: 2.1.3
% 3.32/1.35 % (2148253)Termination reason: Instruction limit
% 3.32/1.35 % (2148253)Termination phase: Saturation
% 3.32/1.35 % (2148253)Time elapsed: 0.067 s
% 3.32/1.35 % (2148253)Peak memory usage: 88 MB
% 3.32/1.35 % (2148253)Instructions burned: 121 (million)
% 3.32/1.35 % (2148254)First to succeed.
% 3.32/1.35 % (2148254)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2148244"
% 3.32/1.35 % (2148252)------------------------------
% 3.32/1.35 % (2148252)------------------------------
% 3.32/1.35 % (2148264)lrs+10_1_sil=8000:sp=occurrence:random_seed=233641230:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.32/1.35 % (2148255)------------------------------
% 3.32/1.35 % (2148255)------------------------------
% 3.32/1.35 % (2148254)Refutation found. Thanks to Tanya!
% 3.32/1.35 % SZS status Theorem for theBenchmark
% 3.32/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 4.13/1.54 % (2148254)------------------------------
% 4.13/1.54 % (2148254)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.54 % (2148254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.54 % (2148254)CaDiCaL version: 2.1.3
% 4.13/1.54 % (2148254)Termination reason: Refutation
% 4.13/1.54 % (2148254)Time elapsed: 0.072 s
% 4.13/1.54 % (2148254)Peak memory usage: 91 MB
% 4.13/1.54 % (2148254)Instructions burned: 125 (million)
% 4.13/1.54 % (2148254)------------------------------
% 4.13/1.54 % (2148254)------------------------------
% 4.13/1.54 % (2148244)Success in time 0.497 s
% 4.13/1.54 % Vampire exiting
%------------------------------------------------------------------------------