%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 17 unt; 0 nHn; 38 RR)
% Number of literals : 123 ( 0 equ; 88 neg)
% Maximal clause size : 10 ( 3 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 : 85 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp4_2,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_2) ).
cnf(t1_FOL_4,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/sandbox2/benchmark/theBenchmark.p',t1_FOL_4) ).
cnf(t3_FOL_8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_8) ).
cnf(t2_FOL_5,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_5) ).
cnf(mp5_3,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_3) ).
cnf(t3_FOL_10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_10) ).
cnf(t3_FOL_7,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_7) ).
cnf(mp4_1,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_1) ).
cnf(t3_FOL_12,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_12) ).
cnf(t3_FOL_9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_9) ).
cnf(t3_FOL_11,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_11) ).
cnf(t3_FOL_6,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL_6) ).
cnf(c_0_12,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X3) ),
inference(fof_simplification,[status(thm)],[mp4_2]) ).
cnf(c_0_13,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_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),
t3_FOL_8 ).
cnf(c_0_16,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(fof_simplification,[status(thm)],[t2_FOL_5]) ).
cnf(c_0_17,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp5_3]) ).
cnf(c_0_18,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_13 ).
cnf(c_0_19,negated_conjecture,
survival_chance(sk2,sk4,sk6),
t3_FOL_10 ).
cnf(c_0_20,negated_conjecture,
organization(sk2,sk6),
t3_FOL_7 ).
cnf(c_0_21,negated_conjecture,
reorganization_free(sk2,sk6,sk6),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5)
| ~ inertia(X4,X3,X5)
| ~ inertia(sk2,X2,sk6)
| ~ survival_chance(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_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,hypothesis,
( ~ reorganization_free(X2,X4,X1)
| ~ organization(X2,X4)
| ~ organization(X2,X1)
| ~ inertia(X2,X3,X4)
| ~ greater(X1,X4)
| greater(sk1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ inertia(X3,X2,X4)
| ~ survival_chance(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_24,c_0_23]),c_0_20])]) ).
cnf(c_0_27,hypothesis,
( ~ reorganization_free(X2,X3,X1)
| ~ organization(X2,X3)
| ~ organization(X2,X1)
| ~ greater(X1,X3)
| greater(sk1(X1,X2),sk1(X3,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_28,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[mp4_1]) ).
cnf(c_0_29,hypothesis,
( ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(sk2,X2,sk6)
| ~ organization(X3,X4)
| ~ organization(sk2,X2)
| ~ inertia(X3,sk1(X2,sk2),X4)
| ~ survival_chance(X3,X1,X4)
| ~ greater(sk6,X2)
| greater(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20])]) ).
cnf(c_0_30,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
~ greater(sk4,sk3),
inference(fof_simplification,[status(thm)],[t3_FOL_12]) ).
cnf(c_0_32,hypothesis,
( ~ reorganization_free(sk2,X2,sk6)
| ~ organization(sk2,X2)
| ~ survival_chance(sk2,X1,X2)
| ~ greater(sk6,X2)
| greater(sk4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
survival_chance(sk2,sk3,sk5),
t3_FOL_9 ).
cnf(c_0_34,negated_conjecture,
greater(sk6,sk5),
t3_FOL_11 ).
cnf(c_0_35,negated_conjecture,
organization(sk2,sk5),
t3_FOL_6 ).
cnf(c_0_36,negated_conjecture,
~ greater(sk4,sk3),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_15])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 % Computer : n006.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Sep 21 01:20:13 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.48 % Version: 3.5.1
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 % Starting sh5l with 300s (1) cores
% 0.16/0.48 % sh5l with pid 1705252 completed with status 0
% 0.16/0.48 % Result found by sh5l
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 % Starting sh5l with 300s (1) cores
% 0.16/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.48 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.48 % SubtermCWHack with pid 1705259 completed with status 0
% 0.16/0.48 % Result found by SubtermCWHack
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 % Starting sh5l with 300s (1) cores
% 0.16/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.48 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.48 % Preprocessing time : 0.002 s
% 0.16/0.48
% 0.16/0.48 % Proof found!
% 0.16/0.48 % SZS status Unsatisfiable
% 0.16/0.48 % SZS output start CNFRefutation
% See solution above
% 0.16/0.48 % Parsed axioms : 12
% 0.16/0.48 % Removed by relevancy pruning/SinE : 0
% 0.16/0.48 % Initial clauses : 12
% 0.16/0.48 % Removed in clause preprocessing : 0
% 0.16/0.48 % Initial clauses in saturation : 12
% 0.16/0.48 % Processed clauses : 23
% 0.16/0.48 % ...of these trivial : 0
% 0.16/0.48 % ...subsumed : 0
% 0.16/0.48 % ...remaining for further processing : 23
% 0.16/0.48 % Other redundant clauses eliminated : 0
% 0.16/0.48 % Clauses deleted for lack of memory : 0
% 0.16/0.48 % Backward-subsumed : 0
% 0.16/0.48 % Backward-rewritten : 0
% 0.16/0.48 % Generated clauses : 18
% 0.16/0.48 % ...of the previous two non-redundant : 13
% 0.16/0.48 % ...aggressively subsumed : 0
% 0.16/0.48 % Contextual simplify-reflections : 1
% 0.16/0.48 % Paramodulations : 18
% 0.16/0.48 % Factorizations : 0
% 0.16/0.48 % NegExts : 0
% 0.16/0.48 % Equation resolutions : 0
% 0.16/0.48 % Disequality decompositions : 0
% 0.16/0.48 % Total rewrite steps : 17
% 0.16/0.48 % ...of those cached : 11
% 0.16/0.48 % Propositional unsat checks : 0
% 0.16/0.48 % Propositional check models : 0
% 0.16/0.48 % Propositional check unsatisfiable : 0
% 0.16/0.48 % Propositional clauses : 0
% 0.16/0.48 % Propositional clauses after purity: 0
% 0.16/0.48 % Propositional unsat core size : 0
% 0.16/0.48 % Propositional preprocessing time : 0.000
% 0.16/0.48 % Propositional encoding time : 0.000
% 0.16/0.48 % Propositional solver time : 0.000
% 0.16/0.48 % Success case prop preproc time : 0.000
% 0.16/0.48 % Success case prop encoding time : 0.000
% 0.16/0.48 % Success case prop solver time : 0.000
% 0.16/0.48 % Current number of processed clauses : 23
% 0.16/0.48 % Positive orientable unit clauses : 8
% 0.16/0.48 % Positive unorientable unit clauses: 0
% 0.16/0.48 % Negative unit clauses : 1
% 0.16/0.48 % Non-unit-clauses : 14
% 0.16/0.48 % Current number of unprocessed clauses: 1
% 0.16/0.48 % ...number of literals in the above : 6
% 0.16/0.48 % Current number of archived formulas : 0
% 0.16/0.48 % Current number of archived clauses : 0
% 0.16/0.48 % Clause-clause subsumption calls (NU) : 80
% 0.16/0.48 % Rec. Clause-clause subsumption calls : 16
% 0.16/0.48 % Non-unit clause-clause subsumptions : 1
% 0.16/0.48 % Unit Clause-clause subsumption calls : 0
% 0.16/0.48 % Rewrite failures with RHS unbound : 0
% 0.16/0.48 % BW rewrite match attempts : 1
% 0.16/0.48 % BW rewrite match successes : 0
% 0.16/0.48 % Condensation attempts : 0
% 0.16/0.48 % Condensation successes : 0
% 0.16/0.48 % Termbank termtop insertions : 915
% 0.16/0.48 % Search garbage collected termcells : 47
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.005 s
% 0.16/0.48 % System time : 0.003 s
% 0.16/0.48 % Total time : 0.008 s
% 0.16/0.48 % Maximum resident set size: 3640 pages
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.006 s
% 0.16/0.48 % System time : 0.007 s
% 0.16/0.48 % Total time : 0.013 s
% 0.16/0.48 % Maximum resident set size: 4864 pages
% 0.16/0.48 % E exiting
%------------------------------------------------------------------------------