%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT008-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:26:00 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 26 unt; 0 nHn; 44 RR)
% Number of literals : 141 ( 0 equ; 100 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a5_FOL_2,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ size(X3,X7,X4)
| ~ size(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL_2) ).
cnf(t8_FOL_13,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_13) ).
cnf(t8_FOL_5,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_5) ).
cnf(t1_FOL_3,hypothesis,
( ~ greater(X6,X5)
| ~ survival_chance(X3,X8,X4)
| ~ survival_chance(X1,X7,X2)
| ~ inertia(X3,X6,X4)
| ~ inertia(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',t1_FOL_3) ).
cnf(t8_FOL_9,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_9) ).
cnf(mp5_1,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_1) ).
cnf(t8_FOL_11,negated_conjecture,
survival_chance(sk3,sk6,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_11) ).
cnf(t8_FOL_7,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_7) ).
cnf(t8_FOL_12,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_12) ).
cnf(t8_FOL_14,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_14) ).
cnf(t8_FOL_8,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_8) ).
cnf(t8_FOL_4,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_4) ).
cnf(t8_FOL_6,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_6) ).
cnf(t8_FOL_15,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_15) ).
cnf(t8_FOL_10,negated_conjecture,
survival_chance(sk2,sk5,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL_10) ).
cnf(c_0_15,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ size(X3,X7,X4)
| ~ size(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
inference(fof_simplification,[status(thm)],[a5_FOL_2]) ).
cnf(c_0_16,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ size(X3,X7,X4)
| ~ size(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
c_0_15 ).
cnf(c_0_17,negated_conjecture,
size(sk3,sk8,sk10),
t8_FOL_13 ).
cnf(c_0_18,negated_conjecture,
organization(sk3,sk10),
t8_FOL_5 ).
cnf(c_0_19,hypothesis,
( ~ greater(X6,X5)
| ~ survival_chance(X3,X8,X4)
| ~ survival_chance(X1,X7,X2)
| ~ inertia(X3,X6,X4)
| ~ inertia(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)],[t1_FOL_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(sk3,X1,sk10)
| ~ class(X4,X6,X5)
| ~ class(sk3,X6,sk10)
| ~ size(X4,X3,X5)
| ~ greater(sk8,X3)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
class(sk3,sk4,sk10),
t8_FOL_9 ).
cnf(c_0_22,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp5_1]) ).
cnf(c_0_23,hypothesis,
( ~ greater(X6,X5)
| ~ survival_chance(X3,X8,X4)
| ~ survival_chance(X1,X7,X2)
| ~ inertia(X3,X6,X4)
| ~ inertia(X1,X5,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X8,X7) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
survival_chance(sk3,sk6,sk10),
t8_FOL_11 ).
cnf(c_0_25,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
t8_FOL_7 ).
cnf(c_0_26,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(sk3,X1,sk10)
| ~ class(X4,sk4,X5)
| ~ size(X4,X3,X5)
| ~ greater(sk8,X3)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X5,X3)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X5)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_18])]) ).
cnf(c_0_29,negated_conjecture,
( ~ organization(X3,X4)
| ~ inertia(X3,X1,X4)
| ~ class(X3,sk4,X4)
| ~ size(X3,X2,X4)
| ~ greater(sk8,X2)
| greater(sk1(sk10,sk3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18])]) ).
cnf(c_0_30,negated_conjecture,
size(sk2,sk7,sk9),
t8_FOL_12 ).
cnf(c_0_31,negated_conjecture,
greater(sk8,sk7),
t8_FOL_14 ).
cnf(c_0_32,negated_conjecture,
class(sk2,sk4,sk9),
t8_FOL_8 ).
cnf(c_0_33,negated_conjecture,
organization(sk2,sk9),
t8_FOL_4 ).
cnf(c_0_34,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X4,X3)
| ~ greater(sk1(sk10,sk3),X4)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_18])]) ).
cnf(c_0_35,negated_conjecture,
( ~ inertia(sk2,X1,sk9)
| greater(sk1(sk10,sk3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X4,X3)
| ~ inertia(sk2,X4,sk9)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(sk6,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,sk1(sk9,sk2),X3)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_27]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
t8_FOL_6 ).
cnf(c_0_39,negated_conjecture,
~ greater(sk6,sk5),
inference(fof_simplification,[status(thm)],[t8_FOL_15]) ).
cnf(c_0_40,negated_conjecture,
( ~ survival_chance(sk2,X1,sk9)
| greater(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_38]),c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
survival_chance(sk2,sk5,sk9),
t8_FOL_10 ).
cnf(c_0_42,negated_conjecture,
~ greater(sk6,sk5),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT008-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.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 01:16:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % sh5l with pid 1109893 completed with status 0
% 0.11/0.44 % Result found by sh5l
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.44 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 1109895 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.44 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 15
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 15
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 15
% 0.11/0.45 % Processed clauses : 30
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 30
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 18
% 0.11/0.45 % ...of the previous two non-redundant : 17
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 18
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 21
% 0.11/0.45 % ...of those cached : 14
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 30
% 0.11/0.45 % Positive orientable unit clauses : 11
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 18
% 0.11/0.45 % Current number of unprocessed clauses: 2
% 0.11/0.45 % ...number of literals in the above : 14
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 0
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 113
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 4
% 0.11/0.45 % Non-unit clause-clause subsumptions : 0
% 0.11/0.45 % Unit Clause-clause subsumption calls : 0
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 1141
% 0.11/0.45 % Search garbage collected termcells : 53
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.003 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.006 s
% 0.11/0.45 % Maximum resident set size: 3644 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.004 s
% 0.11/0.45 % System time : 0.008 s
% 0.11/0.45 % Total time : 0.012 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------