%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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:13:04 PM UTC 2026
% Result : Theorem 0.43s 1.28s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 12 unt; 0 def)
% Number of atoms : 42 ( 21 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 23 ~; 19 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1] :
( ( X1 = conflict
& X0 = compatible
& is_verdict(X1)
& is_verdict(X0) )
=> xone_verdict(X0,X1) = compatible ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+3.ax',xone_compat) ).
fof(f26,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(f27,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
fof(f37,conjecture,
xone_verdict(compatible,conflict) = compatible,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl644) ).
fof(f38,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,plain,
compatible != xone_verdict(compatible,conflict),
inference(flattening,[],[f38]) ).
fof(f60,plain,
! [X0,X1] :
( conflict != X1
| compatible != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| xone_verdict(X0,X1) = compatible ),
inference(ennf_transformation,[],[f14]) ).
fof(f61,plain,
! [X0,X1] :
( conflict != X1
| compatible != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| xone_verdict(X0,X1) = compatible ),
inference(flattening,[],[f60]) ).
fof(f103,plain,
! [X0,X1] :
( conflict != X1
| compatible != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| compatible = xone_verdict(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f119,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f26]) ).
fof(f120,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f27]) ).
fof(f132,plain,
compatible != xone_verdict(compatible,conflict),
inference(cnf_transformation,[],[f39]) ).
fof(f138,plain,
! [X1] :
( conflict != X1
| ~ is_verdict(X1)
| ~ is_verdict(compatible)
| compatible = xone_verdict(compatible,X1) ),
inference(equality_resolution,[],[f103]) ).
fof(f139,plain,
( ~ is_verdict(conflict)
| ~ is_verdict(compatible)
| compatible = xone_verdict(compatible,conflict) ),
inference(equality_resolution,[],[f138]) ).
tcf(c_66,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_82,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f119]) ).
tcf(c_83,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f120]) ).
tcf(c_95,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(cnf_transformation,[],[f132]) ).
tcf(c_101,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_66,c_95,c_82,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 01:27:29 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 0.43/1.28 % SZS status Started for theBenchmark.p
% 0.43/1.28 % SZS status Theorem for theBenchmark.p
% 0.43/1.28
% 0.43/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/1.28
% 0.43/1.28 % ------ iProver source info
% 0.43/1.28
% 0.43/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.43/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/1.28 % git: non_committed_changes: false
% 0.43/1.28
% 0.43/1.28 % ------ Parsing...
% 0.43/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.43/1.28
% 0.43/1.28 % ------ Preprocessing...%
% 0.43/1.28
% 0.43/1.28 % SZS status Theorem for theBenchmark.p
% 0.43/1.28
% 0.43/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.28
% 0.43/1.28
%------------------------------------------------------------------------------