↑ Up

CSI_E---1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar mcs_scs.jar %d %s

% Computer : n028.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:37 AM UTC 2026

% Result   : Theorem 0.25s 0.52s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.07/0.33  % Computer : n028.cluster.edu
% 0.07/0.33  % Model    : x86_64 x86_64
% 0.07/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33  % Memory   : 8046.5625MB
% 0.07/0.33  % OS       : Linux 6.8.0-71-generic
% 0.07/0.33  % CPULimit   : 300
% 0.07/0.33  % WCLimit    : 300
% 0.07/0.33  % DateTime   : Mon Sep  7 14:13:47 UTC 2026
% 0.07/0.33  % CPUTime    : 
% 0.12/0.45  start to proof:theBenchmark.p
% 0.25/0.52  % Version  : CSI_E---1.1
% 0.25/0.52  % Problem  : theBenchmark.p
% 0.25/0.52  % Proof found!
% 0.25/0.52  % SZS status Theorem for theBenchmark.p
% 0.25/0.52  % SZS output start Proof
% 0.25/0.52  fof(odrl302, conjecture, ~(?[X1]:((in_open(X1,v0,v600)&leq(v600,X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', odrl302)).
% 0.25/0.52  fof(leq_antisym, axiom, ![X1, X2]:(((leq(X1,X2)&leq(X2,X1))=>X1=X2)), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', leq_antisym)).
% 0.25/0.52  fof(leq_def, axiom, ![X1, X2]:((leq(X1,X2)<=>(less(X1,X2)|X1=X2))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', leq_def)).
% 0.25/0.52  fof(in_open, axiom, ![X1, X4, X5]:((in_open(X1,X4,X5)<=>(less(X4,X1)&less(X1,X5)))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax', in_open)).
% 0.25/0.52  fof(irreflexive, axiom, ![X1]:(~(less(X1,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', irreflexive)).
% 0.25/0.52  fof(c_0_5, negated_conjecture, ~(~(?[X1]:((in_open(X1,v0,v600)&leq(v600,X1))))), inference(assume_negation,[status(cth)],[odrl302])).
% 0.25/0.52  fof(c_0_6, plain, ![X16, X17]:((~leq(X16,X17)|~leq(X17,X16)|X16=X17)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])])).
% 0.25/0.52  fof(c_0_7, negated_conjecture, (in_open(esk1_0,v0,v600)&leq(v600,esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
% 0.25/0.52  cnf(c_0_8, plain, (X1=X2|~leq(X1,X2)|~leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.25/0.52  cnf(c_0_9, negated_conjecture, (leq(v600,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.25/0.52  fof(c_0_10, plain, ![X14, X15]:(((~leq(X14,X15)|(less(X14,X15)|X14=X15))&((~less(X14,X15)|leq(X14,X15))&(X14!=X15|leq(X14,X15))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 0.25/0.52  fof(c_0_11, plain, ![X29, X30, X31]:((((less(X30,X29)|~in_open(X29,X30,X31))&(less(X29,X31)|~in_open(X29,X30,X31)))&(~less(X30,X29)|~less(X29,X31)|in_open(X29,X30,X31)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_open])])])])).
% 0.25/0.52  cnf(c_0_12, negated_conjecture, (esk1_0=v600|~leq(esk1_0,v600)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.25/0.52  cnf(c_0_13, plain, (leq(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.25/0.52  cnf(c_0_14, plain, (less(X1,X2)|~in_open(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.25/0.52  cnf(c_0_15, negated_conjecture, (in_open(esk1_0,v0,v600)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.25/0.52  fof(c_0_16, plain, ![X1]:(~less(X1,X1)), inference(fof_simplification,[status(thm)],[irreflexive])).
% 0.25/0.52  cnf(c_0_17, negated_conjecture, (esk1_0=v600|~less(esk1_0,v600)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.25/0.52  cnf(c_0_18, negated_conjecture, (less(esk1_0,v600)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.25/0.52  fof(c_0_19, plain, ![X32]:(~less(X32,X32)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])])).
% 0.25/0.52  cnf(c_0_20, negated_conjecture, (esk1_0=v600), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])])).
% 0.25/0.52  cnf(c_0_21, plain, (~less(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.25/0.52  cnf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_20]), c_0_21]), ['proof']).
% 0.25/0.52  % SZS output end Proof
% 0.25/0.52  % User time                : 0.004 s
% 0.25/0.52  % System time              : 0.002 s
% 0.25/0.52  % Total time               : 0.006 s
% 0.25/0.52  % User time                : 0.006 s
% 0.25/0.52  % System time              : 0.005 s
% 0.25/0.52  % Total time               : 0.012 s
% 0.25/0.52  
%------------------------------------------------------------------------------