TSTP Solution File: FLD060-4 by CSE_E---1.5

View Problem - Process Solution

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

% Computer : n025.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:44 EDT 2023

% Result   : Unsatisfiable 0.21s 0.56s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   43 (  15 unt;  14 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   58 (  30   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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   :   37 (   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,
    u: $i ).

tff(decl_35,type,
    v: $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/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).

cnf(sum_7,negated_conjecture,
    sum(b,b,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_7) ).

cnf(less_or_equal_5,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).

cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).

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

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

cnf(sum_6,negated_conjecture,
    sum(a,a,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_6) ).

cnf(transitivity_of_order_relation,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X1,X3)
    | ~ less_or_equal(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).

cnf(not_less_or_equal_8,negated_conjecture,
    ~ less_or_equal(u,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_8) ).

cnf(c_0_10,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_11,negated_conjecture,
    sum(b,b,v),
    sum_7 ).

cnf(c_0_12,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ less_or_equal(X2,b)
    | ~ sum(X2,b,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    less_or_equal(a,b),
    less_or_equal_5 ).

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

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

cnf(c_0_16,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ sum(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( sum(X1,X2,add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

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

cnf(c_0_20,plain,
    ( less_or_equal(X1,add(X2,X3))
    | ~ less_or_equal(X4,X2)
    | ~ defined(X3)
    | ~ defined(X2)
    | ~ sum(X4,X3,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    sum(a,a,u),
    sum_6 ).

cnf(c_0_22,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X1,X3)
    | ~ less_or_equal(X3,X2) ),
    transitivity_of_order_relation ).

cnf(c_0_23,negated_conjecture,
    less_or_equal(add(b,a),v),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_24,negated_conjecture,
    ( less_or_equal(u,add(X1,a))
    | ~ less_or_equal(a,X1)
    | ~ defined(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).

cnf(c_0_25,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ less_or_equal(X1,add(b,a)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    less_or_equal(u,add(b,a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_19])]) ).

cnf(c_0_27,negated_conjecture,
    ~ less_or_equal(u,v),
    not_less_or_equal_8 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : FLD060-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Aug 28 00:20:09 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.21/0.53  start to proof: theBenchmark
% 0.21/0.56  % Version  : CSE_E---1.5
% 0.21/0.56  % Problem  : theBenchmark.p
% 0.21/0.56  % Proof found
% 0.21/0.56  % SZS status Theorem for theBenchmark.p
% 0.21/0.56  % SZS output start Proof
% See solution above
% 0.21/0.56  % Total time : 0.015000 s
% 0.21/0.56  % SZS output end Proof
% 0.21/0.56  % Total time : 0.018000 s
%------------------------------------------------------------------------------