%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:04:31 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 32 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 11 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f35,axiom,
! [X0,X1] :
( prec(X0,X1,o,o)
<=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+5.ax',prec_oo) ).
fof(f48,conjecture,
prec(v5,v5,o,o),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl604) ).
fof(f49,negated_conjecture,
~ prec(v5,v5,o,o),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ prec(v5,v5,o,o),
inference(flattening,[],[f49]) ).
fof(f85,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f86,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f85]) ).
fof(f90,plain,
! [X0,X1] :
( ( prec(X0,X1,o,o)
| ~ leq(X0,X1) )
& ( leq(X0,X1)
| ~ prec(X0,X1,o,o) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f95,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f126,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| prec(X0,X1,o,o) ),
inference(cnf_transformation,[],[f90]) ).
fof(f127,plain,
~ prec(v5,v5,o,o),
inference(cnf_transformation,[],[f50]) ).
fof(f128,plain,
! [X0] : leq(X0,X0),
inference(equality_resolution,[],[f95]) ).
fof(f135,plain,
! [X0] : prec(X0,X0,o,o),
inference(resolution,[],[f126,f128]) ).
fof(f136,plain,
$false,
inference(resolution,[],[f135,f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n020.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:37:05 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.44 % (3637423)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3637433)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2659466575:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.44 % (3637433) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3637423-3637433"...
% 0.11/0.44 % (3637433)...printing done.
% 0.11/0.44 % (3637433)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (3637433)------------------------------
% 0.11/0.44 % (3637433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3637433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3637433)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3637433)Termination reason: Refutation
% 0.11/0.44 % (3637433)Time elapsed: 0.001 s
% 0.11/0.44 % (3637433)Peak memory usage: 11 MB
% 0.11/0.44 % (3637433)Instructions burned: 2 (million)
% 0.11/0.44 % (3637423)Success in time 0.03 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------