%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT066+1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:48:24 PM UTC 2026
% Result : Satisfiable 1.25s 1.72s
% Output : Saturation 1.25s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(definition_greater_or_equal,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( greater(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_greater_or_equal) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(meaning_postulate_greater_transitive,axiom,
! [X1,X2,X3] :
( ( greater(X1,X2)
& greater(X2,X3) )
=> greater(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(meaning_postulate_greater_comparable,axiom,
! [X1,X2] :
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_comparable) ).
fof(definition_smaller,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).
fof(meaning_postulate_greater_strict,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_strict) ).
fof(c_0_6,plain,
! [X19,X20] :
( ( ~ greater_or_equal(X19,X20)
| greater(X19,X20)
| X19 = X20 )
& ( ~ greater(X19,X20)
| greater_or_equal(X19,X20) )
& ( X19 != X20
| greater_or_equal(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_greater_or_equal])])]) ).
fof(c_0_7,plain,
! [X17,X18] :
( ( ~ smaller_or_equal(X17,X18)
| smaller(X17,X18)
| X17 = X18 )
& ( ~ smaller(X17,X18)
| smaller_or_equal(X17,X18) )
& ( X17 != X18
| smaller_or_equal(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])]) ).
fof(c_0_8,plain,
! [X25,X26,X27] :
( ~ greater(X25,X26)
| ~ greater(X26,X27)
| greater(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[meaning_postulate_greater_transitive])]) ).
fof(c_0_9,plain,
! [X28,X29] :
( smaller(X28,X29)
| X28 = X29
| greater(X28,X29) ),
inference(variable_rename,[status(thm)],[meaning_postulate_greater_comparable]) ).
fof(c_0_10,plain,
! [X21,X22] :
( ( ~ smaller(X21,X22)
| greater(X22,X21) )
& ( ~ greater(X22,X21)
| smaller(X21,X22) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])]) ).
fof(c_0_11,plain,
! [X23,X24] :
( ~ greater(X23,X24)
| ~ greater(X24,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[meaning_postulate_greater_strict])]) ).
cnf(c_0_12,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
cnf(c_0_15,plain,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_16,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_17,plain,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
cnf(c_0_18,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_19,plain,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_20,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
cnf(c_0_21,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_22,plain,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_23,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_12]),
[final] ).
cnf(c_0_24,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_13]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT066+1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n005.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:31:00 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Satisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start Saturation
% See solution above
% 1.25/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------