%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT052+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 : n017.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:43 PM UTC 2026
% Result : Theorem 0.05s 0.43s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 75 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 75 ( 31 ~; 29 |; 5 &)
% ( 5 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 67 ( 65 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( smaller(X0,X1)
<=> greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).
fof(f4,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_strict) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( greater(X0,X1)
& greater(X1,X2) )
=> greater(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(f6,axiom,
! [X0,X1] :
( smaller(X0,X1)
| X0 = X1
| greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_comparable) ).
fof(f7,axiom,
! [X0,X1,X2] :
( dissimilar(X0,X1,X2)
<=> ( organization(X0)
& ~ ( is_aligned(X0,X1)
<=> is_aligned(X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2) ).
fof(f8,conjecture,
! [X0,X1] : ~ dissimilar(X0,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',background_assumption_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] : ~ dissimilar(X0,X1,X1),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( dissimilar(X0,X1,X2)
=> ( organization(X0)
& ~ ( is_aligned(X0,X1)
<=> is_aligned(X0,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f11,plain,
! [X0,X1] :
( smaller(X0,X1)
=> greater(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f12,plain,
! [X0,X1,X2] :
( dissimilar(X0,X1,X2)
=> ~ ( is_aligned(X0,X1)
<=> is_aligned(X0,X2) ) ),
inference(pure_predicate_removal,[],[f10]) ).
fof(f13,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ smaller(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f15,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X0,X1)
| ~ greater(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f16,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X0,X1)
| ~ greater(X1,X2) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( is_aligned(X0,X1)
<~> is_aligned(X0,X2) )
| ~ dissimilar(X0,X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
? [X0,X1] : dissimilar(X0,X1,X1),
inference(ennf_transformation,[],[f9]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ( ~ is_aligned(X0,X2)
| ~ is_aligned(X0,X1) )
& ( is_aligned(X0,X2)
| is_aligned(X0,X1) ) )
| ~ dissimilar(X0,X1,X2) ),
inference(nnf_transformation,[],[f17]) ).
fof(f20,plain,
dissimilar(sK0,sK1,sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ smaller(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X2,X0,X1] :
( greater(X0,X1)
| ~ greater(X0,X2)
| ~ greater(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0,X1] :
( smaller(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X2,X0,X1] :
( is_aligned(X0,X2)
| is_aligned(X0,X1)
| ~ dissimilar(X0,X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ is_aligned(X0,X2)
| ~ is_aligned(X0,X1)
| ~ dissimilar(X0,X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
dissimilar(sK0,sK1,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f28,plain,
! [X0,X1] :
( greater(X0,X1)
| smaller(X1,X0) ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f29,plain,
! [X0,X1] :
( ~ smaller(X0,X1)
| X0 = X1
| greater(X0,X1) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f30,plain,
! [X2,X0,X1] :
( is_aligned(X0,X1)
| is_aligned(X0,X2)
| dissimilar(X0,X2,X1) ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ is_aligned(X0,X1)
| ~ is_aligned(X0,X2)
| dissimilar(X0,X2,X1) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f32,plain,
~ dissimilar(sK0,sK1,sK1),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f34,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f28,f22,f23,f29,f30,f31,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT052+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.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 17:24:44 UTC 2026
% 0.05/0.36 % CPUTime :
% 0.05/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.39 Running first-order model finding
% 0.05/0.39 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.05/0.43 % (2822833)Will run a generic schedule for satisfiability detection.
% 0.05/0.43 % (2822838)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=226622299_2999 on theBenchmark for (2999ds/0Mi)
% 0.05/0.43 % Detected minimum model sizes of [1]
% 0.05/0.43 % Detected maximum model sizes of [2]
% 0.05/0.43 % TRYING [1]
% 0.05/0.43 % (2822838) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2822833-2822838"...
% 0.05/0.43 % (2822838)...printing done.
% 0.05/0.43 % (2822838)Refutation found. Thanks to Tanya!
% 0.05/0.43 % SZS status Theorem for theBenchmark
% 0.05/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/0.43 % (2822838)------------------------------
% 0.05/0.43 % (2822838)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/0.43 % (2822838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/0.43 % (2822838)CaDiCaL version: 2.1.3
% 0.05/0.43 % (2822838)Termination reason: Refutation
% 0.05/0.43 % (2822838)Time elapsed: 0.001 s
% 0.05/0.43 % (2822838)Peak memory usage: 11 MB
% 0.05/0.43 % (2822838)Instructions burned: 1 (million)
% 0.05/0.43 % (2822833)Success in time 0.031 s
% 0.05/0.43 % Vampire exiting
%------------------------------------------------------------------------------