↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT014-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 : n009.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:47:06 PM UTC 2026

% Result   : Unsatisfiable 1.28s 1.72s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   49 (  28 unt;   4 nHn;  49 RR)
%            Number of literals    :  115 (  14 equ;  71 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   60 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t11_FOL_24,hypothesis,
    ( ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ reorganization_free(X1,X2,X3)
    | ~ size(X1,X4,X2)
    | ~ size(X1,X5,X3)
    | ~ greater(X3,X2)
    | ~ greater(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).

cnf(t14_FOL_31,negated_conjecture,
    size(sk1,sk4,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_31) ).

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

cnf(mp17_22,axiom,
    ( reorganization_free(X1,X3,X2)
    | ~ reorganization_free(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).

cnf(t14_FOL_28,negated_conjecture,
    reorganization_free(sk1,sk6,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_28) ).

cnf(mp15_20,axiom,
    ( time(X2)
    | ~ organization(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).

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

cnf(mp16_21,axiom,
    ( greater(X1,X2)
    | X1 = X2
    | greater(X2,X1)
    | ~ time(X1)
    | ~ time(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).

cnf(t14_FOL_32,negated_conjecture,
    size(sk1,sk5,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_32) ).

cnf(t14_FOL_33,negated_conjecture,
    greater(sk5,sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_33) ).

cnf(t12_FOL_25,hypothesis,
    ( ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ reorganization_free(X1,X2,X3)
    | ~ complexity(X1,X4,X2)
    | ~ complexity(X1,X5,X3)
    | ~ greater(X3,X2)
    | ~ greater(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).

cnf(t14_FOL_30,negated_conjecture,
    complexity(sk1,sk3,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_30) ).

cnf(t14_FOL_29,negated_conjecture,
    complexity(sk1,sk2,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL_29) ).

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

cnf(mp19_23,axiom,
    ( X4 = X5
    | ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ size(X1,X4,X2)
    | ~ size(X1,X5,X3)
    | X2 != X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp19_23) ).

cnf(mp6_1_18,axiom,
    ( ~ greater(X1,X2)
    | X1 != X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).

cnf(c_0_16,hypothesis,
    ( ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ reorganization_free(X1,X2,X3)
    | ~ size(X1,X4,X2)
    | ~ size(X1,X5,X3)
    | ~ greater(X3,X2)
    | ~ greater(X4,X5) ),
    t11_FOL_24 ).

cnf(c_0_17,negated_conjecture,
    size(sk1,sk4,sk6),
    t14_FOL_31 ).

cnf(c_0_18,negated_conjecture,
    organization(sk1,sk6),
    t14_FOL_26 ).

cnf(c_0_19,axiom,
    ( reorganization_free(X1,X3,X2)
    | ~ reorganization_free(X1,X2,X3) ),
    mp17_22 ).

cnf(c_0_20,negated_conjecture,
    reorganization_free(sk1,sk6,sk7),
    t14_FOL_28 ).

cnf(c_0_21,axiom,
    ( time(X2)
    | ~ organization(X1,X2) ),
    mp15_20 ).

cnf(c_0_22,negated_conjecture,
    organization(sk1,sk7),
    t14_FOL_27 ).

cnf(c_0_23,negated_conjecture,
    ( ~ size(sk1,X1,X2)
    | ~ reorganization_free(sk1,X2,sk6)
    | ~ organization(sk1,X2)
    | ~ greater(X1,sk4)
    | ~ greater(sk6,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_24,negated_conjecture,
    reorganization_free(sk1,sk7,sk6),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,axiom,
    ( greater(X1,X2)
    | X1 = X2
    | greater(X2,X1)
    | ~ time(X1)
    | ~ time(X2) ),
    mp16_21 ).

cnf(c_0_26,negated_conjecture,
    time(sk7),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ size(sk1,X1,sk7)
    | ~ greater(sk6,sk7)
    | ~ greater(X1,sk4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).

cnf(c_0_28,negated_conjecture,
    size(sk1,sk5,sk7),
    t14_FOL_32 ).

cnf(c_0_29,negated_conjecture,
    greater(sk5,sk4),
    t14_FOL_33 ).

cnf(c_0_30,hypothesis,
    ( ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ reorganization_free(X1,X2,X3)
    | ~ complexity(X1,X4,X2)
    | ~ complexity(X1,X5,X3)
    | ~ greater(X3,X2)
    | ~ greater(X4,X5) ),
    t12_FOL_25 ).

cnf(c_0_31,negated_conjecture,
    complexity(sk1,sk3,sk7),
    t14_FOL_30 ).

cnf(c_0_32,negated_conjecture,
    ( X1 = sk7
    | greater(X1,sk7)
    | greater(sk7,X1)
    | ~ time(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_33,negated_conjecture,
    time(sk6),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_34,negated_conjecture,
    ~ greater(sk6,sk7),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ complexity(sk1,X1,X2)
    | ~ reorganization_free(sk1,X2,sk7)
    | ~ organization(sk1,X2)
    | ~ greater(X1,sk3)
    | ~ greater(sk7,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).

cnf(c_0_36,negated_conjecture,
    complexity(sk1,sk2,sk6),
    t14_FOL_29 ).

cnf(c_0_37,negated_conjecture,
    greater(sk2,sk3),
    t14_FOL_34 ).

cnf(c_0_38,axiom,
    ( X4 = X5
    | ~ organization(X1,X2)
    | ~ organization(X1,X3)
    | ~ size(X1,X4,X2)
    | ~ size(X1,X5,X3)
    | X2 != X3 ),
    mp19_23 ).

cnf(c_0_39,negated_conjecture,
    ( sk7 = sk6
    | greater(sk7,sk6) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ~ greater(sk7,sk6),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]),c_0_18]),c_0_37])]) ).

cnf(c_0_41,plain,
    ( X1 = X2
    | ~ size(X3,X2,X4)
    | ~ size(X3,X1,X4)
    | ~ organization(X3,X4) ),
    inference(er,[status(thm)],[c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    sk7 = sk6,
    inference(sr,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    ( X1 = sk4
    | ~ size(sk1,X1,sk6) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_17]),c_0_18])]) ).

cnf(c_0_44,negated_conjecture,
    size(sk1,sk5,sk6),
    inference(rw,[status(thm)],[c_0_28,c_0_42]) ).

cnf(c_0_45,axiom,
    ( ~ greater(X1,X2)
    | X1 != X2 ),
    mp6_1_18 ).

cnf(c_0_46,negated_conjecture,
    sk4 = sk5,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,plain,
    ~ greater(X1,X1),
    inference(er,[status(thm)],[c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_46]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT014-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.14/0.33  % Computer : n009.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 23:26:11 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.28/1.72  % Version  : CSE_E---1.7
% 1.28/1.72  % Problem  : theBenchmark.p
% 1.28/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72  % SZS output start CNFRefutation
% See solution above
% 1.28/1.72  % Total time : 1.374s
%------------------------------------------------------------------------------