%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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 1.47s 6.07s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 23 ( 15 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 20 ( 12 ~; 7 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-6 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ~ axis_subsumes(X0,X1,X2,X3)
=> subs_verdict(X0,X1,present,X2,X3,present) = conflict ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+7.ax',subs_present_no) ).
fof(f79,axiom,
~ axis_subsumes(v0,v800,v0,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_subs_hint) ).
fof(f80,conjecture,
subs_verdict(v0,v800,present,v0,v600,present) = conflict,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl653) ).
fof(f81,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
inference(negated_conjecture,[status(cth)],[f80]) ).
fof(f82,plain,
conflict != subs_verdict(v0,v800,present,v0,v600,present),
inference(flattening,[],[f81]) ).
fof(f116,plain,
! [X0,X1,X2,X3] :
( axis_subsumes(X0,X1,X2,X3)
| subs_verdict(X0,X1,present,X2,X3,present) = conflict ),
inference(ennf_transformation,[],[f36]) ).
fof(f172,plain,
! [X2,X3,X0,X1] :
( axis_subsumes(X0,X1,X2,X3)
| conflict = subs_verdict(X0,X1,present,X2,X3,present) ),
inference(cnf_transformation,[],[f116]) ).
fof(f236,plain,
~ axis_subsumes(v0,v800,v0,v600),
inference(cnf_transformation,[],[f79]) ).
fof(f237,plain,
conflict != subs_verdict(v0,v800,present,v0,v600,present),
inference(cnf_transformation,[],[f82]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( axis_subsumes(X0,X1,X2,X3)
| ( subs_verdict(X0,X1,present,X2,X3,present) = conflict ) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_151,plain,
~ axis_subsumes(v0,v800,v0,v600),
inference(cnf_transformation,[],[f236]) ).
tcf(c_152,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
inference(cnf_transformation,[],[f237]) ).
tcf(c_764,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( subs_verdict(X0,X1,present,X2,X3,present) = conflict )
| ( X3 != v600 )
| ( X2 != v0 )
| ( X1 != v800 )
| ( X0 != v0 ) ),
inference(resolution_lifted,[status(thm)],[c_87,c_151]) ).
tcf(c_765,plain,
subs_verdict(v0,v800,present,v0,v600,present) = conflict,
inference(unflattening,[status(thm)],[c_764]) ).
tcf(c_766,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_765,c_152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.37 % Computer : n013.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:22:28 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.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.15/5.42
% 0.15/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.42
% 0.15/5.42 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 1.47/6.07 % SZS status Started for theBenchmark.p
% 1.47/6.07 % SZS status Theorem for theBenchmark.p
% 1.47/6.07
% 1.47/6.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.47/6.07
% 1.47/6.07 % ------ iProver source info
% 1.47/6.07
% 1.47/6.07 % git: date: 2026-07-19 20:42:38 +0200
% 1.47/6.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.47/6.07 % git: non_committed_changes: false
% 1.47/6.07
% 1.47/6.07 % ------ Parsing...
% 1.47/6.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.47/6.07
% 1.47/6.07 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 1.47/6.07
% 1.47/6.07 % SZS status Theorem for theBenchmark.p
% 1.47/6.07
% 1.47/6.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.47/6.07
% 1.47/6.07
%------------------------------------------------------------------------------