%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT003+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 : n014.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:26 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 15 unt; 2 def)
% Number of atoms : 251 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 344 ( 155 ~; 138 |; 43 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn 125 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4) ).
fof(f2,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( organization(X0,X2)
& organization(X1,X3)
& reorganization_free(X0,X2,X2)
& reorganization_free(X1,X3,X3)
& inertia(X0,X4,X2)
& inertia(X1,X5,X3)
& survival_chance(X0,X6,X2)
& survival_chance(X1,X7,X3)
& greater(X5,X4) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_FOL) ).
fof(f4,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(f5,conjecture,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& survival_chance(X0,X1,X3)
& survival_chance(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& survival_chance(X0,X1,X3)
& survival_chance(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) )
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| ~ survival_chance(X1,X7,X3)
| ~ greater(X5,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| ~ survival_chance(X1,X7,X3)
| ~ greater(X5,X4) ),
inference(flattening,[],[f9]) ).
fof(f11,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,[],[f4]) ).
fof(f12,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,[],[f11]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& survival_chance(X0,X1,X3)
& survival_chance(X0,X2,X4)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& survival_chance(X0,X1,X3)
& survival_chance(X0,X2,X4)
& greater(X4,X3) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f8]) ).
fof(f16,plain,
( ~ greater(sK3,sK2)
& organization(sK1,sK4)
& organization(sK1,sK5)
& reorganization_free(sK1,sK4,sK5)
& survival_chance(sK1,sK2,sK4)
& survival_chance(sK1,sK3,sK5)
& greater(sK5,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f14]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ survival_chance(X1,X7,X3)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| greater(X7,X6)
| ~ greater(X5,X4) ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,X2,X4)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X1,X3)
| greater(X2,X1)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
survival_chance(sK1,sK3,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
survival_chance(sK1,sK2,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
organization(sK1,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
organization(sK1,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f35,plain,
reorganization_free(sK1,sK5,sK5),
inference(resolution,[],[f17,f25]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| greater(sK0(X0,X2),X3)
| ~ greater(X2,X1)
| ~ organization(X0,X2) ),
inference(resolution,[],[f21,f19]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,X3,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| greater(sK0(X0,X2),X3)
| ~ greater(X2,X1) ),
inference(duplicate_literal_removal,[],[f59]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X2,X1)
| ~ organization(X0,X2)
| greater(sK0(X0,X1),sK0(X0,X2))
| ~ greater(X1,X2)
| ~ organization(X0,X2) ),
inference(resolution,[],[f60,f19]) ).
fof(f73,plain,
! [X2,X0,X1] :
( greater(sK0(X0,X1),sK0(X0,X2))
| ~ reorganization_free(X0,X2,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ greater(X1,X2) ),
inference(duplicate_literal_removal,[],[f72]) ).
fof(f206,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(sK1,sK5)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK5)
| ~ survival_chance(X0,X4,X1)
| greater(sK3,X4)
| ~ greater(X3,X2) ),
inference(resolution,[],[f20,f23]) ).
fof(f208,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK5)
| ~ survival_chance(X0,X4,X1)
| greater(sK3,X4)
| ~ greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f206,f26]) ).
fof(f209,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X4,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK5)
| ~ organization(X0,X1)
| greater(sK3,X4)
| ~ greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f208,f35]) ).
fof(f213,plain,
! [X0,X1] :
( ~ reorganization_free(sK1,sK4,sK4)
| ~ inertia(sK1,X0,sK4)
| ~ inertia(sK1,X1,sK5)
| ~ organization(sK1,sK4)
| greater(sK3,sK2)
| ~ greater(X1,X0) ),
inference(resolution,[],[f209,f24]) ).
fof(f214,plain,
! [X0,X1] :
( ~ reorganization_free(sK1,sK4,sK4)
| ~ inertia(sK1,X0,sK4)
| ~ inertia(sK1,X1,sK5)
| greater(sK3,sK2)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f213,f27]) ).
fof(f215,plain,
! [X0,X1] :
( ~ reorganization_free(sK1,sK4,sK4)
| ~ inertia(sK1,X0,sK4)
| ~ inertia(sK1,X1,sK5)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f214,f28]) ).
fof(f217,definition,
( spl6_23
<=> ! [X0,X1] :
( ~ inertia(sK1,X0,sK4)
| ~ inertia(sK1,X1,sK5)
| ~ greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl6_23])],[avatar_definition]) ).
fof(f218,plain,
( ! [X0,X1] :
( ~ inertia(sK1,X1,sK5)
| ~ inertia(sK1,X0,sK4)
| ~ greater(X1,X0) )
| ~ spl6_23 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f220,definition,
( spl6_24
<=> reorganization_free(sK1,sK4,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_24])],[avatar_definition]) ).
fof(f222,plain,
( ~ reorganization_free(sK1,sK4,sK4)
| spl6_24 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f223,plain,
( spl6_23
| ~ spl6_24 ),
inference(avatar_split_clause,[],[f215,f220,f217]) ).
fof(f224,plain,
( ! [X0] :
( ~ inertia(sK1,X0,sK4)
| ~ greater(sK0(sK1,sK5),X0)
| ~ organization(sK1,sK5) )
| ~ spl6_23 ),
inference(resolution,[],[f218,f19]) ).
fof(f225,plain,
( ! [X0] :
( ~ greater(sK0(sK1,sK5),X0)
| ~ inertia(sK1,X0,sK4) )
| ~ spl6_23 ),
inference(forward_subsumption_resolution,[],[f224,f26]) ).
fof(f226,plain,
( ! [X0] :
( ~ inertia(sK1,sK0(sK1,X0),sK4)
| ~ reorganization_free(sK1,X0,sK5)
| ~ organization(sK1,X0)
| ~ organization(sK1,sK5)
| ~ greater(sK5,X0) )
| ~ spl6_23 ),
inference(resolution,[],[f225,f73]) ).
fof(f227,plain,
( ! [X0] :
( ~ inertia(sK1,sK0(sK1,X0),sK4)
| ~ reorganization_free(sK1,X0,sK5)
| ~ organization(sK1,X0)
| ~ greater(sK5,X0) )
| ~ spl6_23 ),
inference(forward_subsumption_resolution,[],[f226,f26]) ).
fof(f228,plain,
( ~ reorganization_free(sK1,sK4,sK5)
| ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| ~ organization(sK1,sK4)
| ~ spl6_23 ),
inference(resolution,[],[f227,f19]) ).
fof(f229,plain,
( ~ reorganization_free(sK1,sK4,sK5)
| ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| ~ spl6_23 ),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f230,plain,
( ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| ~ spl6_23 ),
inference(forward_subsumption_resolution,[],[f229,f25]) ).
fof(f231,plain,
( ~ greater(sK5,sK4)
| ~ spl6_23 ),
inference(forward_subsumption_resolution,[],[f230,f27]) ).
fof(f232,plain,
( $false
| ~ spl6_23 ),
inference(forward_subsumption_resolution,[],[f231,f22]) ).
fof(f233,plain,
~ spl6_23,
inference(avatar_contradiction_clause,[],[f232]) ).
fof(f234,plain,
reorganization_free(sK1,sK4,sK4),
inference(resolution,[],[f18,f25]) ).
fof(f236,plain,
( $false
| spl6_24 ),
inference(forward_subsumption_resolution,[],[f234,f222]) ).
fof(f237,plain,
spl6_24,
inference(avatar_contradiction_clause,[],[f236]) ).
cnf(s148,plain,
( spl6_23
| ~ spl6_24 ),
inference(sat_conversion,[],[f223]) ).
cnf(s155,plain,
~ spl6_23,
inference(sat_conversion,[],[f233]) ).
cnf(s159,plain,
spl6_24,
inference(sat_conversion,[],[f237]) ).
cnf(s160,plain,
$false,
inference(rat,[],[s148,s159,s155]) ).
fof(f238,plain,
$false,
inference(avatar_sat_refutation,[],[s160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT003+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n014.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 17:15:31 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.18/0.47 % (1034273)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (1034280)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=882933749:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (1034279)% WARNING: option uhcvi not known.
% 0.18/0.47 % (1034280) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1034273-1034280"...
% 0.18/0.47 % (1034280)...printing done.
% 0.18/0.47 % (1034280)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (1034280)------------------------------
% 0.18/0.47 % (1034280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (1034280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (1034280)CaDiCaL version: 2.1.3
% 0.18/0.47 % (1034280)Termination reason: Refutation
% 0.18/0.47 % (1034280)Time elapsed: 0.004 s
% 0.18/0.47 % (1034280)Peak memory usage: 12 MB
% 0.18/0.47 % (1034280)Instructions burned: 7 (million)
% 0.18/0.47 % (1034273)Success in time 0.033 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------