%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT044-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 : n012.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:53 PM UTC 2026
% Result : Unsatisfiable 0.04s 5.35s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 12 unt; 0 nHn; 20 RR)
% Number of literals : 48 ( 7 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_9_36,axiom,
( ~ organization(X1)
| internal_friction(X1,X2) = internal_friction(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_9_36) ).
cnf(assumption_5_32,axiom,
( ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| greater(capability(X1,X2),capability(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_32) ).
cnf(lemma_3_37,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_37) ).
cnf(assumption_7_35,axiom,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_7_35) ).
cnf(lemma_3_38,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_38) ).
cnf(lemma_3_39,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_39) ).
cnf(definition_smaller_or_equal_3,axiom,
( X1 != X2
| smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(c_0_7,plain,
( ~ organization(X1)
| internal_friction(X1,X2) = internal_friction(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_9_36]) ).
cnf(c_0_8,plain,
( ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| greater(capability(X1,X2),capability(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_5_32]) ).
cnf(c_0_9,plain,
( ~ organization(X1)
| internal_friction(X1,X2) = internal_friction(X1,X3) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
organization(sk1),
lemma_3_37 ).
cnf(c_0_11,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_7_35]) ).
cnf(c_0_12,plain,
( ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| greater(capability(X1,X2),capability(X1,X3)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
internal_friction(sk1,X1) = internal_friction(sk1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_3_38 ).
cnf(c_0_16,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_3_39]) ).
cnf(c_0_17,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_18,negated_conjecture,
( ~ smaller_or_equal(internal_friction(sk1,X3),internal_friction(sk1,X2))
| ~ greater(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,X2))
| greater(capability(sk1,X1),capability(sk1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
cnf(c_0_19,negated_conjecture,
greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
c_0_16 ).
cnf(c_0_21,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
~ smaller_or_equal(internal_friction(sk1,X1),internal_friction(sk1,sk1)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_20]) ).
cnf(c_0_23,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT044-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.31 % Computer : n012.cluster.edu
% 0.04/5.31 % Model : x86_64 x86_64
% 0.04/5.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.31 % Memory : 8046.5625MB
% 0.04/5.31 % OS : Linux 6.8.0-71-generic
% 0.04/5.31 % CPULimit : 300
% 0.04/5.31 % WCLimit : 300
% 0.04/5.31 % DateTime : Mon Sep 21 01:23:28 UTC 2026
% 0.04/5.31 % CPUTime :
% 0.04/5.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.34 Running first-order theorem proving
% 0.04/5.34 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.04/5.35 % Version: 3.5.1
% 0.04/5.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.35 % Starting new_bool_1 with 300s (1) cores
% 0.04/5.35 % Starting sh5l with 300s (1) cores
% 0.04/5.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1301180 completed with status 0
% 0.04/5.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.04/5.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/5.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/5.35 % No SInE strategy applied
% 0.04/5.35 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.04/5.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/5.35 % Starting SubtermCWHack with 136s (1) cores
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.04/5.35 % Starting new_bool_3 with 136s (1) cores
% 0.04/5.35 % Starting new_bool_1 with 136s (1) cores
% 0.04/5.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1301185 completed with status 0
% 0.04/5.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.04/5.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/5.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/5.35 % No SInE strategy applied
% 0.04/5.35 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.04/5.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/5.35 % Starting SubtermCWHack with 136s (1) cores
% 0.04/5.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.04/5.35 % Preprocessing time : 0.001 s
% 0.04/5.35 % Presaturation interreduction done
% 0.04/5.35
% 0.04/5.35 % Proof found!
% 0.04/5.35 % SZS status Unsatisfiable
% 0.04/5.35 % SZS output start CNFRefutation
% See solution above
% 0.04/5.35 % Parsed axioms : 19
% 0.04/5.35 % Removed by relevancy pruning/SinE : 0
% 0.04/5.35 % Initial clauses : 19
% 0.04/5.35 % Removed in clause preprocessing : 0
% 0.04/5.35 % Initial clauses in saturation : 19
% 0.04/5.35 % Processed clauses : 107
% 0.04/5.35 % ...of these trivial : 0
% 0.04/5.35 % ...subsumed : 29
% 0.04/5.35 % ...remaining for further processing : 78
% 0.04/5.35 % Other redundant clauses eliminated : 2
% 0.04/5.35 % Clauses deleted for lack of memory : 0
% 0.04/5.35 % Backward-subsumed : 3
% 0.04/5.35 % Backward-rewritten : 0
% 0.04/5.35 % Generated clauses : 144
% 0.04/5.35 % ...of the previous two non-redundant : 120
% 0.04/5.35 % ...aggressively subsumed : 0
% 0.04/5.35 % Contextual simplify-reflections : 3
% 0.04/5.35 % Paramodulations : 139
% 0.04/5.35 % Factorizations : 2
% 0.04/5.35 % NegExts : 0
% 0.04/5.35 % Equation resolutions : 3
% 0.04/5.35 % Disequality decompositions : 0
% 0.04/5.35 % Total rewrite steps : 36
% 0.04/5.35 % ...of those cached : 31
% 0.04/5.35 % Propositional unsat checks : 0
% 0.04/5.35 % Propositional check models : 0
% 0.04/5.35 % Propositional check unsatisfiable : 0
% 0.04/5.35 % Propositional clauses : 0
% 0.04/5.35 % Propositional clauses after purity: 0
% 0.04/5.35 % Propositional unsat core size : 0
% 0.04/5.35 % Propositional preprocessing time : 0.000
% 0.04/5.35 % Propositional encoding time : 0.000
% 0.04/5.35 % Propositional solver time : 0.000
% 0.04/5.35 % Success case prop preproc time : 0.000
% 0.04/5.35 % Success case prop encoding time : 0.000
% 0.04/5.35 % Success case prop solver time : 0.000
% 0.04/5.35 % Current number of processed clauses : 54
% 0.04/5.35 % Positive orientable unit clauses : 5
% 0.04/5.35 % Positive unorientable unit clauses: 1
% 0.04/5.35 % Negative unit clauses : 5
% 0.04/5.35 % Non-unit-clauses : 43
% 0.04/5.35 % Current number of unprocessed clauses: 46
% 0.04/5.35 % ...number of literals in the above : 188
% 0.04/5.35 % Current number of archived formulas : 0
% 0.04/5.35 % Current number of archived clauses : 22
% 0.04/5.35 % Clause-clause subsumption calls (NU) : 981
% 0.04/5.35 % Rec. Clause-clause subsumption calls : 786
% 0.04/5.35 % Non-unit clause-clause subsumptions : 20
% 0.04/5.35 % Unit Clause-clause subsumption calls : 3
% 0.04/5.35 % Rewrite failures with RHS unbound : 0
% 0.04/5.35 % BW rewrite match attempts : 0
% 0.04/5.35 % BW rewrite match successes : 0
% 0.04/5.35 % Condensation attempts : 0
% 0.04/5.35 % Condensation successes : 0
% 0.04/5.35 % Termbank termtop insertions : 3067
% 0.04/5.35 % Search garbage collected termcells : 47
% 0.04/5.35
% 0.04/5.35 % -------------------------------------------------
% 0.04/5.35 % User time : 0.005 s
% 0.04/5.35 % System time : 0.002 s
% 0.04/5.35 % Total time : 0.007 s
% 0.04/5.35 % Maximum resident set size: 3592 pages
% 0.04/5.35
% 0.04/5.35 % -------------------------------------------------
% 0.04/5.35 % User time : 0.022 s
% 0.04/5.35 % System time : 0.010 s
% 0.04/5.35 % Total time : 0.031 s
% 0.04/5.35 % Maximum resident set size: 4608 pages
% 0.04/5.35 % E exiting
%------------------------------------------------------------------------------