%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 12:02:29 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 105 ( 30 unt; 5 def)
% Number of atoms : 335 ( 28 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 383 ( 153 ~; 171 |; 46 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 169 ( 0 sgn 155 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1) ).
fof(f3,axiom,
! [X0,X1] :
( organization(X0,X1)
=> time(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15) ).
fof(f4,axiom,
! [X0,X1] :
( ( time(X0)
& time(X1) )
=> ( greater(X0,X1)
| X0 = X1
| greater(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16) ).
fof(f5,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& X3 = X4 )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp19) ).
fof(f7,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL) ).
fof(f8,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,conjecture,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(ennf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f14,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f15,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4] :
( X1 = X2
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| X3 != X4 ),
inference(ennf_transformation,[],[f6]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4] :
( X1 = X2
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| X3 != X4 ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f20,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f8]) ).
fof(f22,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X1,X2)
& organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X1,X2)
& organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X4,X3) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f27,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| time(X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
! [X0,X1] :
( ~ time(X1)
| ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X4] :
( X3 != X4
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| X1 = X2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X4,X3)
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| ~ greater(X1,X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f32,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X4,X3)
| ~ complexity(X0,X2,X4)
| ~ complexity(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| ~ greater(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f33,plain,
greater(sK4,sK3),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
size(sK0,sK4,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
size(sK0,sK3,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
complexity(sK0,sK2,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f37,plain,
complexity(sK0,sK1,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
reorganization_free(sK0,sK5,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
organization(sK0,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f40,plain,
organization(sK0,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
greater(sK1,sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f42,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f25]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( ~ size(X0,X2,X4)
| ~ size(X0,X1,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X4)
| X1 = X2 ),
inference(equality_resolution,[],[f30]) ).
fof(f44,plain,
! [X1] : greater(X1,X1),
inference(consistent_polarity_flipping,[],[f42]) ).
fof(f46,plain,
! [X0,X1] :
( organization(X0,X1)
| time(X1) ),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f47,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ time(X0)
| ~ time(X1)
| X0 = X1
| ~ greater(X0,X1) ),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f48,plain,
! [X2,X0,X1,X4] :
( ~ size(X0,X2,X4)
| ~ size(X0,X1,X4)
| organization(X0,X4)
| organization(X0,X4)
| X1 = X2 ),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f49,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| greater(X4,X3)
| organization(X0,X4)
| organization(X0,X3)
| greater(X1,X2) ),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f50,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X3,X4)
| complexity(X0,X2,X4)
| complexity(X0,X1,X3)
| greater(X4,X3)
| organization(X0,X4)
| organization(X0,X3)
| greater(X1,X2) ),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f51,plain,
~ greater(sK1,sK2),
inference(consistent_polarity_flipping,[],[f41]) ).
fof(f52,plain,
~ organization(sK0,sK5),
inference(consistent_polarity_flipping,[],[f40]) ).
fof(f53,plain,
~ organization(sK0,sK6),
inference(consistent_polarity_flipping,[],[f39]) ).
fof(f54,plain,
~ complexity(sK0,sK1,sK5),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f55,plain,
~ complexity(sK0,sK2,sK6),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f56,plain,
~ greater(sK4,sK3),
inference(consistent_polarity_flipping,[],[f33]) ).
fof(f57,plain,
! [X2,X0,X1,X4] :
( ~ size(X0,X2,X4)
| ~ size(X0,X1,X4)
| organization(X0,X4)
| X1 = X2 ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f58,plain,
time(sK5),
inference(resolution,[],[f46,f52]) ).
fof(f59,plain,
time(sK6),
inference(resolution,[],[f46,f53]) ).
fof(f63,plain,
reorganization_free(sK0,sK6,sK5),
inference(resolution,[],[f29,f38]) ).
fof(f69,plain,
! [X0] :
( ~ size(sK0,X0,sK5)
| organization(sK0,sK5)
| sK3 = X0 ),
inference(resolution,[],[f57,f35]) ).
fof(f70,plain,
! [X0] :
( ~ size(sK0,X0,sK5)
| sK3 = X0 ),
inference(forward_subsumption_resolution,[],[f69,f52]) ).
fof(f76,definition,
( spl7_1
<=> greater(sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f78,plain,
( greater(sK6,sK5)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f83,plain,
! [X0,X1] :
( complexity(sK0,X0,sK6)
| complexity(sK0,X1,sK5)
| greater(sK6,sK5)
| organization(sK0,sK6)
| organization(sK0,sK5)
| greater(X1,X0) ),
inference(resolution,[],[f50,f38]) ).
fof(f84,plain,
! [X0,X1] :
( complexity(sK0,X0,sK6)
| complexity(sK0,X1,sK5)
| greater(sK6,sK5)
| organization(sK0,sK5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f83,f53]) ).
fof(f85,plain,
! [X0,X1] :
( complexity(sK0,X0,sK6)
| complexity(sK0,X1,sK5)
| greater(sK6,sK5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f84,f52]) ).
fof(f87,definition,
( spl7_3
<=> ! [X0,X1] :
( complexity(sK0,X0,sK6)
| complexity(sK0,X1,sK5)
| greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f88,plain,
( ! [X0,X1] :
( complexity(sK0,X0,sK6)
| complexity(sK0,X1,sK5)
| greater(X1,X0) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f89,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f85,f87,f76]) ).
fof(f95,definition,
( spl7_4
<=> greater(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f96,plain,
( greater(sK5,sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f99,definition,
( spl7_5
<=> sK5 = sK6 ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f101,plain,
( sK5 = sK6
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f104,plain,
! [X0,X1] :
( ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| greater(sK5,sK6)
| organization(sK0,sK5)
| organization(sK0,sK6)
| greater(X1,X0) ),
inference(resolution,[],[f63,f49]) ).
fof(f106,plain,
! [X0,X1] :
( ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| greater(sK5,sK6)
| organization(sK0,sK6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f104,f52]) ).
fof(f108,plain,
! [X0,X1] :
( ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| greater(sK5,sK6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f106,f53]) ).
fof(f111,definition,
( spl7_6
<=> ! [X0,X1] :
( ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] :
( ~ size(sK0,X1,sK6)
| ~ size(sK0,X0,sK5)
| greater(X1,X0) )
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( spl7_4
| spl7_6 ),
inference(avatar_split_clause,[],[f108,f111,f95]) ).
fof(f120,plain,
( ~ time(sK6)
| ~ time(sK5)
| sK5 = sK6
| ~ greater(sK6,sK5)
| ~ spl7_4 ),
inference(resolution,[],[f96,f47]) ).
fof(f121,plain,
( ~ time(sK5)
| sK5 = sK6
| ~ greater(sK6,sK5)
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f120,f59]) ).
fof(f122,plain,
( sK5 = sK6
| ~ greater(sK6,sK5)
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f121,f58]) ).
fof(f123,plain,
( sK5 = sK6
| ~ spl7_1
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f122,f78]) ).
fof(f124,plain,
( spl7_5
| ~ spl7_1
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f123,f95,f76,f99]) ).
fof(f126,plain,
( size(sK0,sK4,sK5)
| ~ spl7_5 ),
inference(superposition,[],[f34,f101]) ).
fof(f137,plain,
( sK3 = sK4
| ~ spl7_5 ),
inference(resolution,[],[f126,f70]) ).
fof(f144,plain,
( ~ greater(sK3,sK3)
| ~ spl7_5 ),
inference(superposition,[],[f56,f137]) ).
fof(f145,plain,
( $false
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f144,f44]) ).
fof(f146,plain,
~ spl7_5,
inference(avatar_contradiction_clause,[],[f145]) ).
fof(f149,plain,
( ! [X0] :
( ~ size(sK0,X0,sK5)
| greater(sK4,X0) )
| ~ spl7_6 ),
inference(resolution,[],[f112,f34]) ).
fof(f150,plain,
( greater(sK4,sK3)
| ~ spl7_6 ),
inference(resolution,[],[f149,f35]) ).
fof(f151,plain,
( $false
| ~ spl7_6 ),
inference(forward_subsumption_resolution,[],[f150,f56]) ).
fof(f152,plain,
~ spl7_6,
inference(avatar_contradiction_clause,[],[f151]) ).
fof(f157,plain,
( ! [X0] :
( complexity(sK0,X0,sK5)
| greater(X0,sK2) )
| ~ spl7_3 ),
inference(resolution,[],[f88,f55]) ).
fof(f161,plain,
( greater(sK1,sK2)
| ~ spl7_3 ),
inference(resolution,[],[f157,f54]) ).
fof(f162,plain,
( $false
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f161,f51]) ).
fof(f163,plain,
~ spl7_3,
inference(avatar_contradiction_clause,[],[f162]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f89]) ).
cnf(s4,plain,
( spl7_4
| spl7_6 ),
inference(sat_conversion,[],[f113]) ).
cnf(s6,plain,
( ~ spl7_1
| ~ spl7_4
| spl7_5 ),
inference(sat_conversion,[],[f124]) ).
cnf(s7,plain,
~ spl7_5,
inference(sat_conversion,[],[f146]) ).
cnf(s8,plain,
~ spl7_6,
inference(sat_conversion,[],[f152]) ).
cnf(s12,plain,
~ spl7_3,
inference(sat_conversion,[],[f163]) ).
cnf(s13,plain,
( ~ spl7_1
| ~ spl7_4 ),
inference(rat,[],[s6,s7]) ).
cnf(s14,plain,
spl7_4,
inference(rat,[],[s4,s8]) ).
cnf(s15,plain,
~ spl7_1,
inference(rat,[],[s13,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s2,s12,s15]) ).
fof(f164,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 17:19:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.45 % (3081814)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3081820)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3081819)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3002927733_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (3081821)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2657100028:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3081822)dis+10_1_sil=32000:sp=arity:random_seed=1502488411:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (3081823)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=463801474:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (3081824)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=722432695:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (3081825)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=801267777:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (3081820)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2836549357:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % Detected minimum model sizes of [1]
% 0.11/0.45 % Detected maximum model sizes of [7]
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (3081822) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081814-3081822"...
% 0.11/0.45 % (3081820) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081814-3081820"...
% 0.11/0.45 % (3081823) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081814-3081823"...
% 0.11/0.45 % (3081825) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081814-3081825"...
% 0.11/0.45 % (3081824) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081814-3081824"...
% 0.11/0.45 % TRYING [5]
% 0.11/0.45 % (3081820)...printing done.
% 0.11/0.45 % (3081822)...printing done.
% 0.11/0.45 % (3081820)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3081820)------------------------------
% 0.11/0.45 % (3081820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3081820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3081820)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3081820)Termination reason: Refutation
% 0.11/0.45 % (3081820)Time elapsed: 0.003 s
% 0.11/0.45 % (3081820)Peak memory usage: 13 MB
% 0.11/0.45 % (3081820)Instructions burned: 6 (million)
% 0.11/0.45 % (3081814)Success in time 0.036 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------