↑ Up

CSI_E---1.1.THM-Ass.s

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

% Computer : n029.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:38 AM UTC 2026

% Result   : Theorem 0.34s 0.47s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem    : MGT081+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 : n029.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:18:27 UTC 2026
% 0.07/0.35  % CPUTime    : 
% 0.13/0.42  start to proof:theBenchmark.p
% 0.34/0.47  % Version  : CSI_E---1.1
% 0.34/0.47  % Problem  : theBenchmark.p
% 0.34/0.47  % Proof found!
% 0.34/0.47  % SZS status Theorem for theBenchmark.p
% 0.34/0.47  % SZS output start Proof
% 0.34/0.47  fof(odrl402, conjecture, ~(?[X1, X2]:((((in_lopen(X1,v0,v400)&leq(v800,X1))&in_lopen(X2,v0,v600))&leq(v200,X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', odrl402)).
% 0.34/0.47  fof(in_lopen, axiom, ![X1, X4, X5]:((in_lopen(X1,X4,X5)<=>(less(X4,X1)&leq(X1,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax', in_lopen)).
% 0.34/0.47  fof(leq_antisym, axiom, ![X1, X2]:(((leq(X1,X2)&leq(X2,X1))=>X1=X2)), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_antisym)).
% 0.34/0.47  fof(leq_trans, axiom, ![X1, X2, X3]:(((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_trans)).
% 0.34/0.47  fof(irreflexive, axiom, ![X1]:(~(less(X1,X1))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', irreflexive)).
% 0.34/0.47  fof(less_leq_trans, axiom, ![X1, X2, X3]:(((less(X1,X2)&leq(X2,X3))=>less(X1,X3))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', less_leq_trans)).
% 0.34/0.47  fof(leq_def, axiom, ![X1, X2]:((leq(X1,X2)<=>(less(X1,X2)|X1=X2))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_def)).
% 0.34/0.47  fof(ord_v400_v800, axiom, less(v400,v800), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v400_v800)).
% 0.34/0.47  fof(c_0_8, negated_conjecture, ~(~(?[X1, X2]:((((in_lopen(X1,v0,v400)&leq(v800,X1))&in_lopen(X2,v0,v600))&leq(v200,X2))))), inference(assume_negation,[status(cth)],[odrl402])).
% 0.34/0.47  fof(c_0_9, plain, ![X30, X31, X32]:((((less(X31,X30)|~in_lopen(X30,X31,X32))&(leq(X30,X32)|~in_lopen(X30,X31,X32)))&(~less(X31,X30)|~leq(X30,X32)|in_lopen(X30,X31,X32)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])])).
% 0.34/0.47  fof(c_0_10, negated_conjecture, (((in_lopen(esk1_0,v0,v400)&leq(v800,esk1_0))&in_lopen(esk2_0,v0,v600))&leq(v200,esk2_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
% 0.34/0.47  fof(c_0_11, plain, ![X17, X18]:((~leq(X17,X18)|~leq(X18,X17)|X17=X18)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])])).
% 0.34/0.47  cnf(c_0_12, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.34/0.47  cnf(c_0_13, negated_conjecture, (in_lopen(esk1_0,v0,v400)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.34/0.47  fof(c_0_14, plain, ![X27, X28, X29]:((~leq(X27,X28)|~leq(X28,X29)|leq(X27,X29))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])])])).
% 0.34/0.47  fof(c_0_15, plain, ![X1]:(~less(X1,X1)), inference(fof_simplification,[status(thm)],[irreflexive])).
% 0.34/0.47  fof(c_0_16, plain, ![X24, X25, X26]:((~less(X24,X25)|~leq(X25,X26)|less(X24,X26))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])])])).
% 0.34/0.47  cnf(c_0_17, plain, (X1=X2|~leq(X1,X2)|~leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.34/0.47  cnf(c_0_18, negated_conjecture, (leq(esk1_0,v400)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.34/0.47  cnf(c_0_19, plain, (leq(X1,X3)|~leq(X1,X2)|~leq(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.34/0.47  cnf(c_0_20, negated_conjecture, (leq(v800,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.34/0.47  fof(c_0_21, plain, ![X33]:(~less(X33,X33)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])])).
% 0.34/0.47  cnf(c_0_22, plain, (less(X1,X3)|~less(X1,X2)|~leq(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.34/0.47  cnf(c_0_23, negated_conjecture, (esk1_0=v400|~leq(v400,esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.34/0.47  cnf(c_0_24, negated_conjecture, (leq(X1,esk1_0)|~leq(X1,v800)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.34/0.47  fof(c_0_25, plain, ![X15, X16]:(((~leq(X15,X16)|(less(X15,X16)|X15=X16))&((~less(X15,X16)|leq(X15,X16))&(X15!=X16|leq(X15,X16))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 0.34/0.47  cnf(c_0_26, plain, (~less(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
% 0.34/0.47  cnf(c_0_27, negated_conjecture, (less(X1,esk1_0)|~less(X1,v800)), inference(spm,[status(thm)],[c_0_22, c_0_20])).
% 0.34/0.47  cnf(c_0_28, negated_conjecture, (esk1_0=v400|~leq(v400,v800)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.34/0.47  cnf(c_0_29, plain, (leq(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.34/0.47  cnf(c_0_30, plain, (less(v400,v800)), inference(split_conjunct,[status(thm)],[ord_v400_v800])).
% 0.34/0.47  cnf(c_0_31, negated_conjecture, (~less(esk1_0,v800)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 0.34/0.47  cnf(c_0_32, negated_conjecture, (esk1_0=v400), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])])).
% 0.34/0.47  cnf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32]), c_0_30])]), ['proof']).
% 0.34/0.47  % SZS output end Proof
% 0.34/0.47  % User time                : 0.008 s
% 0.34/0.47  % System time              : 0.003 s
% 0.34/0.47  % Total time               : 0.011 s
% 0.34/0.47  % User time                : 0.008 s
% 0.34/0.47  % System time              : 0.008 s
% 0.34/0.47  % Total time               : 0.016 s
% 0.34/0.47  
%------------------------------------------------------------------------------