%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n010.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 8 06:04:39 AM UTC 2026
% Result : Theorem 0.24s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n010.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 7 14:25:26 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.24/0.46 start to proof:theBenchmark.p
% 0.24/0.55 % Version : CSI_E---1.1
% 0.24/0.55 % Problem : theBenchmark.p
% 0.24/0.55 % Proof found!
% 0.24/0.55 % SZS status Theorem for theBenchmark.p
% 0.24/0.55 % SZS output start Proof
% 0.24/0.55 fof(no_subs_hint, axiom, ~(axis_subsumes(v0,v800,v0,v600)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', no_subs_hint)).
% 0.24/0.55 fof(subs_present_no, axiom, ![X14, X15, X16, X17]:((~(axis_subsumes(X14,X15,X16,X17))=>subs_verdict(X14,X15,present,X16,X17,present)=conflict)), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+7.ax', subs_present_no)).
% 0.24/0.55 fof(odrl653, conjecture, subs_verdict(v0,v800,present,v0,v600,present)=conflict, file('/export/starexec/sandbox/benchmark/theBenchmark.p', odrl653)).
% 0.24/0.55 fof(c_0_3, plain, ~axis_subsumes(v0,v800,v0,v600), inference(fof_simplification,[status(thm)],[no_subs_hint])).
% 0.24/0.55 fof(c_0_4, plain, ![X14, X15, X16, X17]:((~axis_subsumes(X14,X15,X16,X17)=>subs_verdict(X14,X15,present,X16,X17,present)=conflict)), inference(fof_simplification,[status(thm)],[subs_present_no])).
% 0.24/0.55 fof(c_0_5, negated_conjecture, subs_verdict(v0,v800,present,v0,v600,present)!=conflict, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl653])])).
% 0.24/0.55 fof(c_0_6, plain, ~axis_subsumes(v0,v800,v0,v600), inference(fof_nnf,[status(thm)],[c_0_3])).
% 0.24/0.55 fof(c_0_7, plain, ![X27, X28, X29, X30]:((axis_subsumes(X27,X28,X29,X30)|subs_verdict(X27,X28,present,X29,X30,present)=conflict)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
% 0.24/0.55 fof(c_0_8, negated_conjecture, subs_verdict(v0,v800,present,v0,v600,present)!=conflict, inference(fof_nnf,[status(thm)],[c_0_5])).
% 0.24/0.55 cnf(c_0_9, plain, (~axis_subsumes(v0,v800,v0,v600)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.24/0.55 cnf(c_0_10, plain, (axis_subsumes(X1,X2,X3,X4)|subs_verdict(X1,X2,present,X3,X4,present)=conflict), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.55 cnf(c_0_11, negated_conjecture, (subs_verdict(v0,v800,present,v0,v600,present)!=conflict), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.55 cnf(c_0_12, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']).
% 0.24/0.55 % SZS output end Proof
% 0.24/0.55 % User time : 0.012 s
% 0.24/0.55 % System time : 0.003 s
% 0.24/0.55 % Total time : 0.015 s
% 0.24/0.55 % User time : 0.013 s
% 0.24/0.55 % System time : 0.008 s
% 0.24/0.55 % Total time : 0.021 s
% 0.24/0.55
%------------------------------------------------------------------------------