%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT106+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 : Thu Sep 24 01:27:03 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 81 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 81 ( 37 ~; 27 |; 13 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 37 ( 1 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(wit_leq,axiom,
leq(v800,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_leq) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( X1 = X2
| less(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(transitive,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(in_lopen,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( leq(X1,X5)
& less(X4,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(wit_in_lopen,axiom,
in_lopen(w,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_in_lopen) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(distinct,axiom,
( v600 != v800
& v0 != v800
& v0 != v600 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(c_0_9,plain,
! [X21,X22] :
( X21 = X22
| ~ leq(X22,X21)
| ~ leq(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
cnf(c_0_10,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,plain,
leq(v800,w),
inference(split_conjunct,[status(thm)],[wit_leq]) ).
fof(c_0_12,plain,
! [X19,X20] :
( ( leq(X19,X20)
| X19 != X20 )
& ( leq(X19,X20)
| ~ less(X19,X20) )
& ( X19 = X20
| less(X19,X20)
| ~ leq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
fof(c_0_13,plain,
! [X14,X15,X16] :
( less(X14,X16)
| ~ less(X15,X16)
| ~ less(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])])]) ).
fof(c_0_14,plain,
! [X37,X38,X39] :
( ( in_lopen(X37,X38,X39)
| ~ leq(X37,X39)
| ~ less(X38,X37) )
& ( ~ in_lopen(X37,X38,X39)
| leq(X37,X39) )
& ( ~ in_lopen(X37,X38,X39)
| less(X38,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])]) ).
cnf(c_0_15,plain,
( ~ leq(w,v800)
| w = v800 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
cnf(c_0_19,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
in_lopen(w,v0,v600),
inference(split_conjunct,[status(thm)],[wit_in_lopen]) ).
fof(c_0_21,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_22,plain,
( ~ less(w,v800)
| w = v800 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ less(X1,v600)
| less(X1,v800) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ leq(X1,X2)
| X1 = X2
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
leq(w,v600),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_26,plain,
( v600 != v800
& v0 != v800
& v0 != v600 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
fof(c_0_27,plain,
! [X13] : ~ less(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
cnf(c_0_28,plain,
( ~ less(w,v600)
| w = v800 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( less(w,v600)
| w = v600 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
( v600 != v800
& v0 != v800
& v0 != v600 ),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( w = v800
| w = v600 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
~ less(v800,v600),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_35,plain,
w = v600,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_35]),c_0_35]),c_0_18])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT106+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:30:22 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1281633 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 1281646 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Preprocessing time : 0.002 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 36
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 56
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 56
% 0.15/0.44 % Processed clauses : 57
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 3
% 0.15/0.44 % ...remaining for further processing : 54
% 0.15/0.44 % Other redundant clauses eliminated : 3
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 16
% 0.15/0.44 % Generated clauses : 50
% 0.15/0.44 % ...of the previous two non-redundant : 44
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 44
% 0.15/0.44 % Factorizations : 3
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 3
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 18
% 0.15/0.44 % ...of those cached : 12
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 35
% 0.15/0.44 % Positive orientable unit clauses : 10
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 8
% 0.15/0.44 % Non-unit-clauses : 17
% 0.15/0.44 % Current number of unprocessed clauses: 40
% 0.15/0.44 % ...number of literals in the above : 117
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 16
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 79
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 77
% 0.15/0.44 % Non-unit clause-clause subsumptions : 3
% 0.15/0.44 % Unit Clause-clause subsumption calls : 9
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 2
% 0.15/0.44 % BW rewrite match successes : 1
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 3441
% 0.15/0.44 % Search garbage collected termcells : 736
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.009 s
% 0.15/0.44 % System time : 0.004 s
% 0.15/0.44 % Total time : 0.013 s
% 0.15/0.44 % Maximum resident set size: 3412 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.028 s
% 0.15/0.44 % System time : 0.014 s
% 0.15/0.44 % Total time : 0.042 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------