%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT048-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 : n013.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:54 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 11 unt; 0 nHn; 20 RR)
% Number of literals : 49 ( 7 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_10_35,axiom,
( ~ organization(X1)
| stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_10_35) ).
cnf(assumption_5_33,axiom,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_33) ).
cnf(lemma_5_37,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_37) ).
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(assumption_12_36,axiom,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_12_36) ).
cnf(lemma_5_39,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_39) ).
cnf(lemma_5_38,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_38) ).
cnf(c_0_7,plain,
( ~ organization(X1)
| stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_10_35]) ).
cnf(c_0_8,plain,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_5_33]) ).
cnf(c_0_9,plain,
( ~ organization(X1)
| stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
organization(sk1),
lemma_5_37 ).
cnf(c_0_11,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_12,plain,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
stock_of_knowledge(sk1,X1) = stock_of_knowledge(sk1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_12_36]) ).
cnf(c_0_16,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_5_39]) ).
cnf(c_0_17,negated_conjecture,
( ~ smaller_or_equal(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,X3))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2))
| smaller(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_18,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_5_38 ).
cnf(c_0_21,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2))
| smaller(capability(sk1,X1),capability(sk1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT048-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n013.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:23:22 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.50 % Version: 3.5.1
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 % Starting sh5l with 300s (1) cores
% 0.16/0.50 % new_bool_3 with pid 3858281 completed with status 0
% 0.16/0.50 % Result found by new_bool_3
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.16/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.50 % SubtermCWHack with pid 3858287 completed with status 0
% 0.16/0.50 % Result found by SubtermCWHack
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.16/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.50 % Preprocessing time : 0.002 s
% 0.16/0.50
% 0.16/0.50 % Proof found!
% 0.16/0.50 % SZS status Unsatisfiable
% 0.16/0.50 % SZS output start CNFRefutation
% See solution above
% 0.16/0.50 % Parsed axioms : 19
% 0.16/0.50 % Removed by relevancy pruning/SinE : 3
% 0.16/0.50 % Initial clauses : 16
% 0.16/0.50 % Removed in clause preprocessing : 0
% 0.16/0.50 % Initial clauses in saturation : 16
% 0.16/0.50 % Processed clauses : 118
% 0.16/0.50 % ...of these trivial : 0
% 0.16/0.50 % ...subsumed : 50
% 0.16/0.50 % ...remaining for further processing : 68
% 0.16/0.50 % Other redundant clauses eliminated : 1
% 0.16/0.50 % Clauses deleted for lack of memory : 0
% 0.16/0.50 % Backward-subsumed : 4
% 0.16/0.50 % Backward-rewritten : 0
% 0.16/0.50 % Generated clauses : 435
% 0.16/0.50 % ...of the previous two non-redundant : 402
% 0.16/0.50 % ...aggressively subsumed : 0
% 0.16/0.50 % Contextual simplify-reflections : 3
% 0.16/0.50 % Paramodulations : 425
% 0.16/0.50 % Factorizations : 8
% 0.16/0.50 % NegExts : 0
% 0.16/0.50 % Equation resolutions : 2
% 0.16/0.50 % Disequality decompositions : 0
% 0.16/0.50 % Total rewrite steps : 38
% 0.16/0.50 % ...of those cached : 35
% 0.16/0.50 % Propositional unsat checks : 0
% 0.16/0.50 % Propositional check models : 0
% 0.16/0.50 % Propositional check unsatisfiable : 0
% 0.16/0.50 % Propositional clauses : 0
% 0.16/0.50 % Propositional clauses after purity: 0
% 0.16/0.50 % Propositional unsat core size : 0
% 0.16/0.50 % Propositional preprocessing time : 0.000
% 0.16/0.50 % Propositional encoding time : 0.000
% 0.16/0.50 % Propositional solver time : 0.000
% 0.16/0.50 % Success case prop preproc time : 0.000
% 0.16/0.50 % Success case prop encoding time : 0.000
% 0.16/0.50 % Success case prop solver time : 0.000
% 0.16/0.50 % Current number of processed clauses : 63
% 0.16/0.50 % Positive orientable unit clauses : 4
% 0.16/0.50 % Positive unorientable unit clauses: 1
% 0.16/0.50 % Negative unit clauses : 5
% 0.16/0.50 % Non-unit-clauses : 53
% 0.16/0.50 % Current number of unprocessed clauses: 299
% 0.16/0.50 % ...number of literals in the above : 1664
% 0.16/0.50 % Current number of archived formulas : 0
% 0.16/0.50 % Current number of archived clauses : 4
% 0.16/0.50 % Clause-clause subsumption calls (NU) : 1146
% 0.16/0.50 % Rec. Clause-clause subsumption calls : 770
% 0.16/0.50 % Non-unit clause-clause subsumptions : 41
% 0.16/0.50 % Unit Clause-clause subsumption calls : 0
% 0.16/0.50 % Rewrite failures with RHS unbound : 12
% 0.16/0.50 % BW rewrite match attempts : 0
% 0.16/0.50 % BW rewrite match successes : 0
% 0.16/0.50 % Condensation attempts : 0
% 0.16/0.50 % Condensation successes : 0
% 0.16/0.50 % Termbank termtop insertions : 7763
% 0.16/0.50 % Search garbage collected termcells : 50
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.018 s
% 0.16/0.50 % System time : 0.008 s
% 0.16/0.50 % Total time : 0.026 s
% 0.16/0.50 % Maximum resident set size: 3644 pages
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.020 s
% 0.16/0.50 % System time : 0.015 s
% 0.16/0.50 % Total time : 0.035 s
% 0.16/0.50 % Maximum resident set size: 4864 pages
% 0.16/0.50 % E exiting
%------------------------------------------------------------------------------