%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:28 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 84 ( 20 unt; 3 def)
% Number of atoms : 332 ( 12 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 414 ( 166 ~; 198 |; 40 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 220 ( 0 sgn 206 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(f4,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : class(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(f5,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X1)
& organization(X0,X2)
& reorganization_free(X0,X1,X2)
& class(X0,X3,X1)
& class(X0,X4,X2) )
=> X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& complexity(X0,X3,X7)
& complexity(X1,X4,X8)
& inertia(X0,X5,X7)
& inertia(X1,X6,X8)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL) ).
fof(f7,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(f8,conjecture,
! [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/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,negated_conjecture,
~ ! [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) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X2] : class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X0,X3,X7)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X0,X3,X7)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X1,X3)
| ~ inertia(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X1,X3)
| ~ inertia(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f18]) ).
fof(f20,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,[],[f9]) ).
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(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X0,X1] :
( class(X0,sK1(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
complexity(sK2,sK4,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
complexity(sK2,sK3,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
reorganization_free(sK2,sK5,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f33,plain,
organization(sK2,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
organization(sK2,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
greater(sK3,sK4),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X0,X1] :
( ~ inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f39,plain,
! [X0,X1] :
( greater(X1,X0)
| greater(X0,X1) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ class(X0,X2,X7)
| inertia(X1,X6,X8)
| inertia(X0,X5,X7)
| ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ class(X1,X2,X8)
| greater(X4,X3)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| ~ greater(X6,X5) ),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X2,X1)
| inertia(X0,X2,X4)
| inertia(X0,X1,X3)
| reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X4,X3) ),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f43,plain,
~ greater(sK3,sK4),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f44,plain,
~ reorganization_free(sK2,sK5,sK6),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f45,plain,
~ greater(sK6,sK5),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ class(X0,X1,X2)
| reorganization_free(X0,X2,X3)
| ~ organization(X0,X3)
| ~ organization(X0,X2)
| sK1(X0,X3) = X1
| ~ organization(X0,X3) ),
inference(resolution,[],[f40,f25]) ).
fof(f50,plain,
! [X2,X3,X0,X1] :
( ~ class(X0,X1,X2)
| reorganization_free(X0,X2,X3)
| ~ organization(X0,X3)
| ~ organization(X0,X2)
| sK1(X0,X3) = X1 ),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X4)
| inertia(X0,X3,X4)
| reorganization_free(X0,X4,X2)
| ~ organization(X0,X2)
| inertia(X0,X1,X2)
| greater(X2,X4)
| greater(X3,X1) ),
inference(resolution,[],[f42,f39]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( inertia(X0,X1,X2)
| inertia(X3,X4,X5)
| ~ complexity(X0,X6,X2)
| ~ complexity(X3,X7,X5)
| ~ class(X0,sK1(X3,X5),X2)
| greater(X6,X7)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X1,X4)
| ~ organization(X3,X5) ),
inference(resolution,[],[f41,f25]) ).
fof(f56,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ class(X0,sK1(X3,X5),X2)
| inertia(X3,X4,X5)
| ~ complexity(X0,X6,X2)
| ~ complexity(X3,X7,X5)
| inertia(X0,X1,X2)
| greater(X6,X7)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X1,X4) ),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f57,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| sK1(X0,X1) = sK1(X0,X2)
| ~ organization(X0,X1) ),
inference(resolution,[],[f50,f25]) ).
fof(f58,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| sK1(X0,X1) = sK1(X0,X2) ),
inference(duplicate_literal_removal,[],[f57]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ organization(sK2,X1)
| reorganization_free(sK2,sK5,X1)
| inertia(sK2,X0,sK5)
| inertia(sK2,X2,X1)
| greater(X1,sK5)
| greater(X0,X2) ),
inference(resolution,[],[f52,f34]) ).
fof(f90,plain,
! [X0,X1] :
( reorganization_free(sK2,sK5,sK6)
| inertia(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| greater(sK6,sK5)
| greater(X0,X1) ),
inference(resolution,[],[f75,f33]) ).
fof(f92,plain,
! [X0,X1] :
( inertia(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| greater(sK6,sK5)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f90,f44]) ).
fof(f93,plain,
! [X0,X1] :
( inertia(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f92,f45]) ).
fof(f94,plain,
( ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| sK1(sK2,sK5) = sK1(sK2,sK6) ),
inference(resolution,[],[f58,f44]) ).
fof(f95,plain,
( ~ organization(sK2,sK5)
| sK1(sK2,sK5) = sK1(sK2,sK6) ),
inference(forward_subsumption_resolution,[],[f94,f33]) ).
fof(f96,plain,
sK1(sK2,sK5) = sK1(sK2,sK6),
inference(forward_subsumption_resolution,[],[f95,f34]) ).
fof(f97,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ class(X0,sK1(sK2,sK5),X1)
| inertia(sK2,X2,sK6)
| ~ complexity(X0,X3,X1)
| ~ complexity(sK2,X4,sK6)
| inertia(X0,X5,X1)
| greater(X3,X4)
| ~ organization(X0,X1)
| ~ organization(sK2,sK6)
| ~ greater(X5,X2) ),
inference(superposition,[],[f56,f96]) ).
fof(f100,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ complexity(sK2,X4,sK6)
| inertia(sK2,X2,sK6)
| ~ complexity(X0,X3,X1)
| ~ class(X0,sK1(sK2,sK5),X1)
| inertia(X0,X5,X1)
| greater(X3,X4)
| ~ organization(X0,X1)
| ~ greater(X5,X2) ),
inference(forward_subsumption_resolution,[],[f97,f33]) ).
fof(f132,definition,
( spl7_7
<=> ! [X1] : inertia(sK2,X1,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_7])],[avatar_definition]) ).
fof(f133,plain,
( ! [X1] : inertia(sK2,X1,sK5)
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f152,definition,
( spl7_9
<=> ! [X1] : inertia(sK2,X1,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_9])],[avatar_definition]) ).
fof(f153,plain,
( ! [X1] : inertia(sK2,X1,sK6)
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f157,plain,
( ~ organization(sK2,sK6)
| ~ spl7_9 ),
inference(resolution,[],[f153,f37]) ).
fof(f158,plain,
( $false
| ~ spl7_9 ),
inference(forward_subsumption_resolution,[],[f157,f33]) ).
fof(f159,plain,
~ spl7_9,
inference(avatar_contradiction_clause,[],[f158]) ).
fof(f189,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(X1,sK1(sK2,sK5),X3)
| ~ complexity(X1,X2,X3)
| inertia(sK2,X0,sK6)
| inertia(X1,X4,X3)
| greater(X2,sK4)
| ~ organization(X1,X3)
| ~ greater(X4,X0) ),
inference(resolution,[],[f100,f30]) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ complexity(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| inertia(sK2,X2,sK5)
| greater(X0,sK4)
| ~ organization(sK2,sK5)
| ~ greater(X2,X1)
| ~ organization(sK2,sK5) ),
inference(resolution,[],[f189,f25]) ).
fof(f220,plain,
! [X2,X0,X1] :
( ~ complexity(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| inertia(sK2,X2,sK5)
| greater(X0,sK4)
| ~ organization(sK2,sK5)
| ~ greater(X2,X1) ),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f221,plain,
! [X2,X0,X1] :
( ~ complexity(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| inertia(sK2,X2,sK5)
| greater(X0,sK4)
| ~ organization(sK2,sK5) ),
inference(forward_subsumption_resolution,[],[f220,f93]) ).
fof(f222,plain,
! [X2,X0,X1] :
( ~ complexity(sK2,X0,sK5)
| inertia(sK2,X1,sK6)
| inertia(sK2,X2,sK5)
| greater(X0,sK4) ),
inference(forward_subsumption_resolution,[],[f221,f34]) ).
fof(f224,definition,
( spl7_16
<=> ! [X0] :
( ~ complexity(sK2,X0,sK5)
| greater(X0,sK4) ) ),
introduced(definition,[new_symbols(definition,[spl7_16])],[avatar_definition]) ).
fof(f225,plain,
( ! [X0] :
( ~ complexity(sK2,X0,sK5)
| greater(X0,sK4) )
| ~ spl7_16 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f226,plain,
( spl7_7
| spl7_9
| spl7_16 ),
inference(avatar_split_clause,[],[f222,f224,f152,f132]) ).
fof(f227,plain,
( ~ organization(sK2,sK5)
| ~ spl7_7 ),
inference(resolution,[],[f133,f37]) ).
fof(f228,plain,
( $false
| ~ spl7_7 ),
inference(forward_subsumption_resolution,[],[f227,f34]) ).
fof(f229,plain,
~ spl7_7,
inference(avatar_contradiction_clause,[],[f228]) ).
fof(f230,plain,
( greater(sK3,sK4)
| ~ spl7_16 ),
inference(resolution,[],[f225,f31]) ).
fof(f231,plain,
( $false
| ~ spl7_16 ),
inference(forward_subsumption_resolution,[],[f230,f43]) ).
fof(f232,plain,
~ spl7_16,
inference(avatar_contradiction_clause,[],[f231]) ).
cnf(s14,plain,
~ spl7_9,
inference(sat_conversion,[],[f159]) ).
cnf(s19,plain,
( spl7_7
| spl7_9
| spl7_16 ),
inference(sat_conversion,[],[f226]) ).
cnf(s20,plain,
~ spl7_7,
inference(sat_conversion,[],[f229]) ).
cnf(s21,plain,
~ spl7_16,
inference(sat_conversion,[],[f232]) ).
cnf(s22,plain,
spl7_9,
inference(rat,[],[s19,s21,s20]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s14,s22]) ).
fof(f233,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n008.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 17:16:54 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 % (1476104)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1476112)% WARNING: option uhcvi not known.
% 0.17/0.47 % (1476112)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3473423271:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (1476112) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1476104-1476112"...
% 0.17/0.47 % (1476114)dis+10_1_sil=32000:sp=arity:random_seed=344925148:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (1476112)...printing done.
% 0.17/0.47 % (1476111)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2281977194_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (1476116)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=55286771:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (1476113)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2754072677:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (1476115)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3700132169:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (1476117)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1444181019:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (1476112)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (1476112)------------------------------
% 0.17/0.47 % (1476112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1476112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1476112)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1476112)Termination reason: Refutation
% 0.17/0.47 % (1476112)Time elapsed: 0.005 s
% 0.17/0.47 % (1476112)Peak memory usage: 12 MB
% 0.17/0.47 % (1476112)Instructions burned: 11 (million)
% 0.17/0.47 % (1476104)Success in time 0.039 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------