↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT048-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:48:20 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.72s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  11 unt;   0 nHn;  16 RR)
%            Number of literals    :   36 (   5 equ;  19 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   :   29 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(assumption_10_35,axiom,
    ( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
    | ~ organization(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_10_35) ).

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

cnf(assumption_5_33,axiom,
    ( smaller(capability(X1,X2),capability(X1,X3))
    | ~ organization(X1)
    | ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
    | ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_33) ).

cnf(assumption_12_36,axiom,
    ( greater(internal_friction(X1,X2),internal_friction(X1,X3))
    | ~ organization(X1)
    | ~ greater(age(X1,X2),age(X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_12_36) ).

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

cnf(lemma_5_39,negated_conjecture,
    ~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_39) ).

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

cnf(c_0_7,axiom,
    ( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
    | ~ organization(X1) ),
    assumption_10_35 ).

cnf(c_0_8,negated_conjecture,
    organization(sk1),
    lemma_5_37 ).

cnf(c_0_9,axiom,
    ( smaller(capability(X1,X2),capability(X1,X3))
    | ~ organization(X1)
    | ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
    | ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
    assumption_5_33 ).

cnf(c_0_10,negated_conjecture,
    stock_of_knowledge(sk1,X1) = stock_of_knowledge(sk1,X2),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    ( greater(internal_friction(X1,X2),internal_friction(X1,X3))
    | ~ organization(X1)
    | ~ greater(age(X1,X2),age(X1,X3)) ),
    assumption_12_36 ).

cnf(c_0_12,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    lemma_5_38 ).

cnf(c_0_13,negated_conjecture,
    ( smaller(capability(sk1,X1),capability(sk1,X2))
    | ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2))
    | ~ smaller_or_equal(stock_of_knowledge(sk1,X3),stock_of_knowledge(sk1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).

cnf(c_0_14,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_11,c_0_12]),c_0_8])]) ).

cnf(c_0_15,negated_conjecture,
    ~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
    lemma_5_39 ).

cnf(c_0_16,axiom,
    ( smaller_or_equal(X1,X2)
    | X1 != X2 ),
    definition_smaller_or_equal_3 ).

cnf(c_0_17,negated_conjecture,
    ~ smaller_or_equal(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,sk2)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_18,plain,
    smaller_or_equal(X1,X1),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT048-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May  4 23:30:02 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.34  % start to proof: theBenchmark
% 1.27/1.72  % Version  : CSE_E---1.7
% 1.27/1.72  % Problem  : theBenchmark.p
% 1.27/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72  % SZS output start CNFRefutation
% See solution above
% 1.27/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------