%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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 : Fri Sep 25 02:11:57 PM UTC 2026
% Result : Theorem 21.80s 9.11s
% Output : Proof 21.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 14 unt; 0 def)
% Number of atoms : 43 ( 23 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 45 ( 23 ~; 18 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [Vm,Vr] :
( ( Vr = conflict
& Vm = compatible
& is_verdict(Vr)
& is_verdict(Vm) )
=> xone_verdict(Vm,Vr) = compatible ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xone_compat) ).
fof(f13_nnf,plain,
! [Vm,Vr] :
( xone_verdict(Vm,Vr) = compatible
| Vr != conflict
| Vm != compatible
| ~ is_verdict(Vr)
| ~ is_verdict(Vm) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [Vm,Vr] :
( xone_verdict(Vm,Vr) = compatible
| Vr != conflict
| Vm != compatible
| ~ is_verdict(Vr)
| ~ is_verdict(Vm) ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c17,plain,
( xone_verdict(X0,X1) = compatible
| X1 != conflict
| X0 != compatible
| ~ is_verdict(X1)
| ~ is_verdict(X0) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(p128,plain,
( xone_verdict(compatible,X0) = compatible
| X0 != conflict
| ~ is_verdict(X0)
| ~ is_verdict(compatible) ),
inference(equality_resolution,[status(thm)],[c17]) ).
cnf(p951,plain,
( xone_verdict(compatible,conflict) = compatible
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(equality_resolution,[status(thm)],[p128]) ).
fof(f26,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatible_is_verdict) ).
fof(f26_nnf,plain,
is_verdict(compatible),
inference(nnf_transformation,[status(thm)],[f26]) ).
cnf(c50,plain,
is_verdict(compatible),
inference(cnf_transformation,[status(esa)],[f26_nnf]) ).
cnf(p953,plain,
( xone_verdict(compatible,conflict) = compatible
| ~ is_verdict(conflict) ),
inference(resolution,[status(thm)],[p951,c50]) ).
fof(f25,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conflict_is_verdict) ).
fof(f25_nnf,plain,
is_verdict(conflict),
inference(nnf_transformation,[status(thm)],[f25]) ).
cnf(c49,plain,
is_verdict(conflict),
inference(cnf_transformation,[status(esa)],[f25_nnf]) ).
cnf(p954,plain,
xone_verdict(compatible,conflict) = compatible,
inference(resolution,[status(thm)],[p953,c49]) ).
fof(f36,conjecture,
xone_verdict(compatible,conflict) = compatible,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl644) ).
fof(f36_neg,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f36_nnf,plain,
xone_verdict(compatible,conflict) != compatible,
inference(nnf_transformation,[status(thm)],[f36_neg]) ).
fof(f36_sk,plain,
xone_verdict(compatible,conflict) != compatible,
inference(skolemisation,[status(esa)],[f36_nnf]) ).
cnf(c62,plain,
xone_verdict(compatible,conflict) != compatible,
inference(cnf_transformation,[status(esa)],[f36_sk]) ).
cnf(p955,plain,
compatible != compatible,
inference(demodulation,[status(thm)],[p954,c62]) ).
cnf(p958,plain,
$false,
inference(equality_resolution,[status(thm)],[p955]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.37 % Computer : n003.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 01:24:40 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 21.80/9.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.80/9.11 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------