%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT002-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:25:58 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 18 unt; 0 nHn; 40 RR)
% Number of literals : 118 ( 0 equ; 81 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 83 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp4_3,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_3) ).
cnf(a3_FOL_4,hypothesis,
( ~ greater(X6,X5)
| ~ inertia(X3,X8,X4)
| ~ inertia(X1,X7,X2)
| ~ reproducibility(X3,X6,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X8,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL_4) ).
cnf(t2_FOL_9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_9) ).
cnf(a4_FOL_6,hypothesis,
( ~ greater(X3,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a4_FOL_6) ).
cnf(t2_FOL_11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_11) ).
cnf(t2_FOL_8,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_8) ).
cnf(mp3_1,axiom,
( ~ organization(X1,X2)
| reproducibility(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3_1) ).
cnf(t2_FOL_12,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_12) ).
cnf(t2_FOL_7,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_7) ).
cnf(mp4_2,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_2) ).
cnf(t2_FOL_13,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_13) ).
cnf(t2_FOL_10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_10) ).
cnf(c_0_12,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
inference(fof_simplification,[status(thm)],[mp4_3]) ).
cnf(c_0_13,hypothesis,
( ~ greater(X6,X5)
| ~ inertia(X3,X8,X4)
| ~ inertia(X1,X7,X2)
| ~ reproducibility(X3,X6,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X8,X7) ),
inference(fof_simplification,[status(thm)],[a3_FOL_4]) ).
cnf(c_0_14,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
t2_FOL_9 ).
cnf(c_0_16,hypothesis,
( ~ greater(X3,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(fof_simplification,[status(thm)],[a4_FOL_6]) ).
cnf(c_0_17,hypothesis,
( ~ greater(X6,X5)
| ~ inertia(X3,X8,X4)
| ~ inertia(X1,X7,X2)
| ~ reproducibility(X3,X6,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X8,X7) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
inertia(sk2,sk4,sk6),
t2_FOL_11 ).
cnf(c_0_19,negated_conjecture,
reorganization_free(sk2,sk6,sk6),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
organization(sk2,sk6),
t2_FOL_8 ).
cnf(c_0_21,plain,
( ~ organization(X1,X2)
| reproducibility(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp3_1]) ).
cnf(c_0_22,hypothesis,
( ~ greater(X3,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
greater(sk6,sk5),
t2_FOL_12 ).
cnf(c_0_24,negated_conjecture,
organization(sk2,sk5),
t2_FOL_7 ).
cnf(c_0_25,negated_conjecture,
( ~ organization(X4,X5)
| ~ reproducibility(X4,X3,X5)
| ~ reproducibility(sk2,X2,sk6)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(X4,X1,X5)
| ~ greater(X2,X3)
| greater(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_26,plain,
( ~ organization(X1,X2)
| reproducibility(X1,sk1(X2,X1),X2) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
( ~ reproducibility(sk2,X2,sk5)
| ~ reproducibility(sk2,X1,sk6)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]),c_0_20]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
( ~ organization(X3,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X1,X4)
| ~ greater(sk1(sk6,sk2),X2)
| greater(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
( ~ reproducibility(sk2,X1,sk5)
| greater(sk1(sk6,sk2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_20])]) ).
cnf(c_0_30,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[mp4_2]) ).
cnf(c_0_31,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,X4,X3)
| ~ reproducibility(sk2,X4,sk5)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,X1,X3)
| greater(sk4,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
c_0_30 ).
cnf(c_0_33,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,sk1(sk5,sk2),X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,X1,X3)
| greater(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
reorganization_free(sk2,sk5,sk5),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_35,negated_conjecture,
~ greater(sk4,sk3),
inference(fof_simplification,[status(thm)],[t2_FOL_13]) ).
cnf(c_0_36,negated_conjecture,
( ~ inertia(sk2,X1,sk5)
| greater(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_34]),c_0_24])]) ).
cnf(c_0_37,negated_conjecture,
inertia(sk2,sk3,sk5),
t2_FOL_10 ).
cnf(c_0_38,negated_conjecture,
~ greater(sk4,sk3),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT002-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 01:15:29 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % sh5l with pid 1107482 completed with status 0
% 0.15/0.45 % Result found by sh5l
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 1107491 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Unsatisfiable
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 13
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 13
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 13
% 0.15/0.45 % Processed clauses : 26
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 0
% 0.15/0.45 % ...remaining for further processing : 26
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 0
% 0.15/0.45 % Generated clauses : 22
% 0.15/0.45 % ...of the previous two non-redundant : 17
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 0
% 0.15/0.45 % Paramodulations : 22
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 24
% 0.15/0.45 % ...of those cached : 19
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 26
% 0.15/0.45 % Positive orientable unit clauses : 8
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 1
% 0.15/0.45 % Non-unit-clauses : 17
% 0.15/0.45 % Current number of unprocessed clauses: 4
% 0.15/0.45 % ...number of literals in the above : 28
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 0
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 122
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 26
% 0.15/0.45 % Non-unit clause-clause subsumptions : 0
% 0.15/0.45 % Unit Clause-clause subsumption calls : 0
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 1
% 0.15/0.45 % BW rewrite match successes : 0
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 1100
% 0.15/0.45 % Search garbage collected termcells : 56
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.006 s
% 0.15/0.45 % System time : 0.001 s
% 0.15/0.45 % Total time : 0.007 s
% 0.15/0.45 % Maximum resident set size: 3640 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.006 s
% 0.15/0.45 % System time : 0.007 s
% 0.15/0.45 % Total time : 0.013 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------