TSTP Solution File: FLD013-3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : FLD013-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% 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 : Wed Aug 30 22:27:17 EDT 2023

% Result   : Unsatisfiable 0.54s 0.69s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   56 (  19 unt;  14 typ;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   92 (  46   ~;  46   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   8   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    sum: ( $i * $i * $i ) > $o ).

tff(decl_23,type,
    additive_identity: $i ).

tff(decl_24,type,
    defined: $i > $o ).

tff(decl_25,type,
    additive_inverse: $i > $i ).

tff(decl_26,type,
    product: ( $i * $i * $i ) > $o ).

tff(decl_27,type,
    multiplicative_identity: $i ).

tff(decl_28,type,
    multiplicative_inverse: $i > $i ).

tff(decl_29,type,
    add: ( $i * $i ) > $i ).

tff(decl_30,type,
    multiply: ( $i * $i ) > $i ).

tff(decl_31,type,
    less_or_equal: ( $i * $i ) > $o ).

tff(decl_32,type,
    a: $i ).

tff(decl_33,type,
    b: $i ).

tff(decl_34,type,
    c: $i ).

tff(decl_35,type,
    d: $i ).

cnf(compatibility_of_order_relation_and_addition,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).

cnf(sum_5,negated_conjecture,
    sum(additive_identity,a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_5) ).

cnf(totality_of_order_relation,axiom,
    ( less_or_equal(X1,X2)
    | less_or_equal(X2,X1)
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).

cnf(existence_of_identity_addition,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

cnf(antisymmetry_of_order_relation,axiom,
    ( sum(additive_identity,X1,X2)
    | ~ less_or_equal(X1,X2)
    | ~ less_or_equal(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).

cnf(associativity_addition_2,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X4,X5,X1)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X6,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).

cnf(sum_6,negated_conjecture,
    sum(additive_identity,c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_6) ).

cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

cnf(totality_of_addition,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).

cnf(d_is_defined,hypothesis,
    defined(d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

cnf(not_sum_7,negated_conjecture,
    ~ sum(a,c,add(d,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_7) ).

cnf(c_0_14,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    compatibility_of_order_relation_and_addition ).

cnf(c_0_15,negated_conjecture,
    sum(additive_identity,a,b),
    sum_5 ).

cnf(c_0_16,axiom,
    ( less_or_equal(X1,X2)
    | less_or_equal(X2,X1)
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_order_relation ).

cnf(c_0_17,negated_conjecture,
    ( less_or_equal(X1,b)
    | ~ less_or_equal(X2,additive_identity)
    | ~ sum(X2,a,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    ( less_or_equal(X1,X1)
    | ~ defined(X1) ),
    inference(ef,[status(thm)],[c_0_16]) ).

cnf(c_0_19,axiom,
    defined(additive_identity),
    well_definedness_of_additive_identity ).

cnf(c_0_20,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    existence_of_identity_addition ).

cnf(c_0_21,negated_conjecture,
    ( less_or_equal(X1,b)
    | ~ sum(additive_identity,a,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_22,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_23,plain,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,additive_identity)
    | ~ defined(X2)
    | ~ sum(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_24,axiom,
    ( sum(additive_identity,X1,X2)
    | ~ less_or_equal(X1,X2)
    | ~ less_or_equal(X2,X1) ),
    antisymmetry_of_order_relation ).

cnf(c_0_25,negated_conjecture,
    less_or_equal(a,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_22])]) ).

cnf(c_0_26,plain,
    ( less_or_equal(X1,X2)
    | ~ defined(X2)
    | ~ sum(additive_identity,X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19])]) ).

cnf(c_0_27,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X4,X5,X1)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X6,X3) ),
    associativity_addition_2 ).

cnf(c_0_28,negated_conjecture,
    sum(additive_identity,c,d),
    sum_6 ).

cnf(c_0_29,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    commutativity_addition ).

cnf(c_0_30,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_addition ).

cnf(c_0_31,negated_conjecture,
    ( sum(additive_identity,b,a)
    | ~ less_or_equal(b,a) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    less_or_equal(b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_22])]) ).

cnf(c_0_33,negated_conjecture,
    ( sum(X1,c,X2)
    | ~ sum(X3,d,X2)
    | ~ sum(X3,additive_identity,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    ( sum(X1,X2,add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,hypothesis,
    defined(d),
    d_is_defined ).

cnf(c_0_36,negated_conjecture,
    sum(additive_identity,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).

cnf(c_0_37,negated_conjecture,
    ( sum(X1,c,add(d,X2))
    | ~ defined(X2)
    | ~ sum(X2,additive_identity,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).

cnf(c_0_38,negated_conjecture,
    sum(b,additive_identity,a),
    inference(spm,[status(thm)],[c_0_29,c_0_36]) ).

cnf(c_0_39,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_40,negated_conjecture,
    ~ sum(a,c,add(d,b)),
    not_sum_7 ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : FLD013-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 00:44:35 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.52/0.56  start to proof: theBenchmark
% 0.54/0.69  % Version  : CSE_E---1.5
% 0.54/0.69  % Problem  : theBenchmark.p
% 0.54/0.69  % Proof found
% 0.54/0.69  % SZS status Theorem for theBenchmark.p
% 0.54/0.69  % SZS output start Proof
% See solution above
% 0.54/0.70  % Total time : 0.126000 s
% 0.54/0.70  % SZS output end Proof
% 0.54/0.70  % Total time : 0.129000 s
%------------------------------------------------------------------------------