↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : MGT046-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 : n002.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.13s 0.45s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   49 (  16 unt;   6 nHn;  45 RR)
%            Number of literals    :  117 (   6 equ;  65 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   81 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(assumption_6_48,axiom,
    ( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
    | ~ organization(X1)
    | greater(position(X1,X2),position(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6_48) ).

cnf(assumption_8_51,axiom,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(external_ties(X1,X2),external_ties(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_8_51) ).

cnf(assumption_5_45,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/sandbox/benchmark/theBenchmark.p',assumption_5_45) ).

cnf(assumption_9_52,axiom,
    ( ~ organization(X1)
    | internal_friction(X1,X2) = internal_friction(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_9_52) ).

cnf(assumption_7_50,axiom,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_7_50) ).

cnf(assumption_4_43,axiom,
    ( ~ greater(position(X1,X3),position(X1,X2))
    | ~ greater_or_equal(capability(X1,X3),capability(X1,X2))
    | ~ organization(X1)
    | smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
    | has_immunity(X1,X3)
    | has_immunity(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_4_43) ).

cnf(theorem_1_55,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_1_55) ).

cnf(theorem_1_53,negated_conjecture,
    organization(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_1_53) ).

cnf(theorem_1_56,negated_conjecture,
    ~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_1_56) ).

cnf(definition_smaller_or_equal_3,axiom,
    ( X1 != X2
    | smaller_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).

cnf(definition_greater_or_equal_5,axiom,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_5) ).

cnf(assumption_1_41,axiom,
    ( ~ has_immunity(X1,X2)
    | ~ organization(X1)
    | has_endowment(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_1_41) ).

cnf(theorem_1_54,negated_conjecture,
    ~ has_endowment(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_1_54) ).

cnf(c_0_13,plain,
    ( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
    | ~ organization(X1)
    | greater(position(X1,X2),position(X1,X3)) ),
    inference(fof_simplification,[status(thm)],[assumption_6_48]) ).

cnf(c_0_14,plain,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(external_ties(X1,X2),external_ties(X1,X3)) ),
    inference(fof_simplification,[status(thm)],[assumption_8_51]) ).

cnf(c_0_15,plain,
    ( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
    | ~ organization(X1)
    | greater(position(X1,X2),position(X1,X3)) ),
    c_0_13 ).

cnf(c_0_16,plain,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(external_ties(X1,X2),external_ties(X1,X3)) ),
    c_0_14 ).

cnf(c_0_17,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_45]) ).

cnf(c_0_18,plain,
    ( ~ organization(X1)
    | internal_friction(X1,X2) = internal_friction(X1,X3) ),
    inference(fof_simplification,[status(thm)],[assumption_9_52]) ).

cnf(c_0_19,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_50]) ).

cnf(c_0_20,plain,
    ( ~ greater(position(X1,X3),position(X1,X2))
    | ~ greater_or_equal(capability(X1,X3),capability(X1,X2))
    | ~ organization(X1)
    | smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
    | has_immunity(X1,X3)
    | has_immunity(X1,X2) ),
    inference(fof_simplification,[status(thm)],[assumption_4_43]) ).

cnf(c_0_21,plain,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(position(X1,X2),position(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    theorem_1_55 ).

cnf(c_0_23,negated_conjecture,
    organization(sk1),
    theorem_1_53 ).

cnf(c_0_24,negated_conjecture,
    ~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
    inference(fof_simplification,[status(thm)],[theorem_1_56]) ).

cnf(c_0_25,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_17 ).

cnf(c_0_26,plain,
    ( ~ organization(X1)
    | internal_friction(X1,X2) = internal_friction(X1,X3) ),
    c_0_18 ).

cnf(c_0_27,plain,
    ( ~ greater(age(X1,X2),age(X1,X3))
    | ~ organization(X1)
    | greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
    c_0_19 ).

cnf(c_0_28,plain,
    ( X1 != X2
    | smaller_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).

cnf(c_0_29,plain,
    ( ~ greater(position(X1,X3),position(X1,X2))
    | ~ greater_or_equal(capability(X1,X3),capability(X1,X2))
    | ~ organization(X1)
    | smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
    | has_immunity(X1,X3)
    | has_immunity(X1,X2) ),
    c_0_20 ).

cnf(c_0_30,negated_conjecture,
    greater(position(sk1,sk3),position(sk1,sk2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_31,negated_conjecture,
    ~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
    c_0_24 ).

cnf(c_0_32,plain,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[definition_greater_or_equal_5]) ).

cnf(c_0_33,plain,
    ( ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X4))
    | ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
    | ~ organization(X1)
    | greater(capability(X1,X2),capability(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,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_27,c_0_22]),c_0_23])]) ).

cnf(c_0_35,plain,
    ( X1 != X2
    | smaller_or_equal(X1,X2) ),
    c_0_28 ).

cnf(c_0_36,negated_conjecture,
    ( ~ greater_or_equal(capability(sk1,sk3),capability(sk1,sk2))
    | has_immunity(sk1,sk3)
    | has_immunity(sk1,sk2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23])]),c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    c_0_32 ).

cnf(c_0_38,negated_conjecture,
    ( ~ smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,X1))
    | greater(capability(sk1,sk3),capability(sk1,sk2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).

cnf(c_0_39,plain,
    smaller_or_equal(X1,X1),
    inference(er,[status(thm)],[c_0_35]) ).

cnf(c_0_40,plain,
    ( ~ has_immunity(X1,X2)
    | ~ organization(X1)
    | has_endowment(X1) ),
    inference(fof_simplification,[status(thm)],[assumption_1_41]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ greater(capability(sk1,sk3),capability(sk1,sk2))
    | has_immunity(sk1,sk2)
    | has_immunity(sk1,sk3) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    greater(capability(sk1,sk3),capability(sk1,sk2)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ has_endowment(sk1),
    inference(fof_simplification,[status(thm)],[theorem_1_54]) ).

cnf(c_0_44,plain,
    ( ~ has_immunity(X1,X2)
    | ~ organization(X1)
    | has_endowment(X1) ),
    c_0_40 ).

cnf(c_0_45,negated_conjecture,
    ( has_immunity(sk1,sk3)
    | has_immunity(sk1,sk2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).

cnf(c_0_46,negated_conjecture,
    ~ has_endowment(sk1),
    c_0_43 ).

cnf(c_0_47,negated_conjecture,
    has_immunity(sk1,sk3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_23])]),c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_23])]),c_0_46]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT046-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.37  % Computer : n002.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 01:26:33 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/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.13/0.45  % Version: 3.5.1
% 0.13/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45  % Starting sh5l with 300s (1) cores
% 0.13/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2154275 completed with status 0
% 0.13/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45  % No SInE strategy applied
% 0.13/0.45  % Search class: FGHSF-FFMF22-SFFFFFNN
% 0.13/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.13/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.13/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2154280 completed with status 0
% 0.13/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45  % No SInE strategy applied
% 0.13/0.45  % Search class: FGHSF-FFMF22-SFFFFFNN
% 0.13/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.45  % Preprocessing time       : 0.002 s
% 0.13/0.45  % Presaturation interreduction done
% 0.13/0.45  
% 0.13/0.45  % Proof found!
% 0.13/0.45  % SZS status Unsatisfiable
% 0.13/0.45  % SZS output start CNFRefutation
% See solution above
% 0.13/0.45  % Parsed axioms                        : 27
% 0.13/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.45  % Initial clauses                      : 27
% 0.13/0.45  % Removed in clause preprocessing      : 0
% 0.13/0.45  % Initial clauses in saturation        : 27
% 0.13/0.45  % Processed clauses                    : 166
% 0.13/0.45  % ...of these trivial                  : 0
% 0.13/0.45  % ...subsumed                          : 45
% 0.13/0.45  % ...remaining for further processing  : 121
% 0.13/0.45  % Other redundant clauses eliminated   : 2
% 0.13/0.45  % Clauses deleted for lack of memory   : 0
% 0.13/0.45  % Backward-subsumed                    : 3
% 0.13/0.45  % Backward-rewritten                   : 3
% 0.13/0.45  % Generated clauses                    : 240
% 0.13/0.45  % ...of the previous two non-redundant : 221
% 0.13/0.45  % ...aggressively subsumed             : 0
% 0.13/0.45  % Contextual simplify-reflections      : 1
% 0.13/0.45  % Paramodulations                      : 233
% 0.13/0.45  % Factorizations                       : 2
% 0.13/0.45  % NegExts                              : 0
% 0.13/0.45  % Equation resolutions                 : 5
% 0.13/0.45  % Disequality decompositions           : 0
% 0.13/0.45  % Total rewrite steps                  : 45
% 0.13/0.45  % ...of those cached                   : 39
% 0.13/0.45  % Propositional unsat checks           : 0
% 0.13/0.45  %    Propositional check models        : 0
% 0.13/0.45  %    Propositional check unsatisfiable : 0
% 0.13/0.45  %    Propositional clauses             : 0
% 0.13/0.45  %    Propositional clauses after purity: 0
% 0.13/0.45  %    Propositional unsat core size     : 0
% 0.13/0.45  %    Propositional preprocessing time  : 0.000
% 0.13/0.45  %    Propositional encoding time       : 0.000
% 0.13/0.45  %    Propositional solver time         : 0.000
% 0.13/0.45  %    Success case prop preproc time    : 0.000
% 0.13/0.45  %    Success case prop encoding time   : 0.000
% 0.13/0.45  %    Success case prop solver time     : 0.000
% 0.13/0.45  % Current number of processed clauses  : 86
% 0.13/0.45  %    Positive orientable unit clauses  : 8
% 0.13/0.45  %    Positive unorientable unit clauses: 0
% 0.13/0.45  %    Negative unit clauses             : 8
% 0.13/0.45  %    Non-unit-clauses                  : 70
% 0.13/0.45  % Current number of unprocessed clauses: 102
% 0.13/0.45  % ...number of literals in the above   : 406
% 0.13/0.45  % Current number of archived formulas  : 0
% 0.13/0.45  % Current number of archived clauses   : 33
% 0.13/0.45  % Clause-clause subsumption calls (NU) : 1899
% 0.13/0.45  % Rec. Clause-clause subsumption calls : 1351
% 0.13/0.45  % Non-unit clause-clause subsumptions  : 41
% 0.13/0.45  % Unit Clause-clause subsumption calls : 7
% 0.13/0.45  % Rewrite failures with RHS unbound    : 0
% 0.13/0.45  % BW rewrite match attempts            : 2
% 0.13/0.45  % BW rewrite match successes           : 2
% 0.13/0.45  % Condensation attempts                : 0
% 0.13/0.45  % Condensation successes               : 0
% 0.13/0.45  % Termbank termtop insertions          : 4886
% 0.13/0.45  % Search garbage collected termcells   : 81
% 0.13/0.45  
% 0.13/0.45  % -------------------------------------------------
% 0.13/0.45  % User time                : 0.013 s
% 0.13/0.45  % System time              : 0.003 s
% 0.13/0.45  % Total time               : 0.016 s
% 0.13/0.45  % Maximum resident set size: 3652 pages
% 0.13/0.45  
% 0.13/0.45  % -------------------------------------------------
% 0.13/0.45  % User time                : 0.068 s
% 0.13/0.45  % System time              : 0.015 s
% 0.13/0.45  % Total time               : 0.082 s
% 0.13/0.45  % Maximum resident set size: 4864 pages
% 0.13/0.45  % E exiting
%------------------------------------------------------------------------------