%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.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:26 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 14 unt; 1 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 210 ( 110 ~; 99 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_1) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_2) ).
fof(f3,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X7,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X7,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_FOL_4) ).
fof(f5,axiom,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_5) ).
fof(f6,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_6) ).
fof(f7,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_7) ).
fof(f8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_8) ).
fof(f9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_9) ).
fof(f10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_10) ).
fof(f11,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_11) ).
fof(f12,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_12) ).
fof(f13,plain,
reorganization_free(sk2,sk5,sk5),
inference(resolution,[],[f1,f8]) ).
fof(f15,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,X2,X3)
| ~ reorganization_free(X0,X3,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X1)
| ~ greater(X1,X3)
| greater(sk1(X1,X0),X2)
| ~ organization(X0,X1) ),
inference(resolution,[],[f5,f3]) ).
fof(f16,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,X2,X3)
| ~ reorganization_free(X0,X3,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X1)
| ~ greater(X1,X3)
| greater(sk1(X1,X0),X2) ),
inference(duplicate_literal_removal,[],[f15]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(sk1(X2,X0),sk1(X1,X0))
| ~ organization(X0,X1) ),
inference(resolution,[],[f16,f3]) ).
fof(f19,plain,
! [X2,X0,X1] :
( greater(sk1(X2,X0),sk1(X1,X0))
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(duplicate_literal_removal,[],[f18]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X1,X2)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(sk2,X3,sk5)
| ~ inertia(X0,X4,X2)
| ~ organization(sk2,sk5)
| ~ organization(X0,X2)
| ~ greater(X4,X3)
| greater(X1,sk3) ),
inference(resolution,[],[f4,f9]) ).
fof(f27,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X1,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(sk2,X3,sk5)
| ~ inertia(X0,X4,X2)
| ~ organization(sk2,sk5)
| ~ organization(X0,X2)
| ~ greater(X4,X3)
| greater(X1,sk3) ),
inference(forward_subsumption_resolution,[],[f20,f13]) ).
fof(f29,definition,
( spl0_1
<=> reorganization_free(sk2,sk6,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f30,plain,
( reorganization_free(sk2,sk6,sk6)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f31,plain,
( ~ reorganization_free(sk2,sk6,sk6)
| spl0_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X1,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(sk2,X3,sk5)
| ~ inertia(X0,X4,X2)
| ~ organization(X0,X2)
| ~ greater(X4,X3)
| greater(X1,sk3) ),
inference(forward_subsumption_resolution,[],[f27,f6]) ).
fof(f42,plain,
( ! [X0] : ~ reorganization_free(sk2,X0,sk6)
| spl0_1 ),
inference(resolution,[],[f31,f2]) ).
fof(f57,plain,
! [X0,X1] :
( ~ reorganization_free(sk2,sk6,sk6)
| ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ organization(sk2,sk6)
| ~ greater(X1,X0)
| greater(sk4,sk3) ),
inference(resolution,[],[f41,f10]) ).
fof(f58,plain,
( $false
| spl0_1 ),
inference(resolution,[],[f42,f8]) ).
fof(f61,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f63,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ organization(sk2,sk6)
| ~ greater(X1,X0)
| greater(sk4,sk3) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f57,f30]) ).
fof(f65,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ greater(X1,X0)
| greater(sk4,sk3) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f63,f7]) ).
fof(f74,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ greater(X1,X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f65,f12]) ).
fof(f88,plain,
( ! [X0] :
( ~ inertia(sk2,X0,sk5)
| ~ greater(sk1(sk6,sk2),X0)
| ~ organization(sk2,sk6) )
| ~ spl0_1 ),
inference(resolution,[],[f74,f3]) ).
fof(f89,plain,
( ! [X0] :
( ~ inertia(sk2,X0,sk5)
| ~ greater(sk1(sk6,sk2),X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f88,f7]) ).
fof(f93,plain,
( ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ organization(sk2,sk5)
| ~ spl0_1 ),
inference(resolution,[],[f89,f3]) ).
fof(f94,plain,
( ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f93,f6]) ).
fof(f102,plain,
( ~ organization(sk2,sk5)
| ~ organization(sk2,sk6)
| ~ greater(sk6,sk5)
| ~ reorganization_free(sk2,sk5,sk6)
| ~ spl0_1 ),
inference(resolution,[],[f19,f94]) ).
fof(f103,plain,
( ~ organization(sk2,sk6)
| ~ greater(sk6,sk5)
| ~ reorganization_free(sk2,sk5,sk6)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f102,f6]) ).
fof(f104,plain,
( ~ greater(sk6,sk5)
| ~ reorganization_free(sk2,sk5,sk6)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f103,f7]) ).
fof(f105,plain,
( ~ reorganization_free(sk2,sk5,sk6)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f104,f11]) ).
fof(f106,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f105,f8]) ).
fof(f107,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f106]) ).
cnf(s4,plain,
spl0_1,
inference(sat_conversion,[],[f61]) ).
cnf(s7,plain,
~ spl0_1,
inference(sat_conversion,[],[f107]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s4,s7]) ).
fof(f108,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n008.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:16:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.10/0.45 % (1474467)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1474476)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=735377511:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1474476) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1474467-1474476"...
% 0.10/0.45 % (1474473)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1474476)...printing done.
% 0.10/0.45 % (1474472)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2849315387_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (1474476)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1474476)------------------------------
% 0.10/0.46 % (1474476)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1474476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1474476)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1474476)Termination reason: Refutation
% 0.10/0.46 % (1474476)Time elapsed: 0.002 s
% 0.10/0.46 % (1474476)Peak memory usage: 12 MB
% 0.10/0.46 % (1474476)Instructions burned: 4 (million)
% 0.10/0.46 % (1474467)Success in time 0.029 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------