TSTP Solution File: SYO038-1.003.003 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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 : Fri Sep  1 04:09:30 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   42 (  32 unt;   4 typ;   0 def)
%            Number of atoms       :   44 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   27 (  21   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   16 (   2 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    one: $i ).

tff(decl_23,type,
    f: ( $i * $i ) > $i ).

tff(decl_24,type,
    s: $i > $i ).

tff(decl_25,type,
    d: $i > $o ).

cnf(ax3,axiom,
    f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

cnf(ax1,axiom,
    f(X1,one) = s(one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

cnf(ax5,axiom,
    ( d(s(X1))
    | ~ d(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(ax2,axiom,
    f(one,s(X1)) = s(s(f(one,X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(conj,negated_conjecture,
    ~ d(f(s(s(one)),s(s(one)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

cnf(ax4,axiom,
    d(one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(c_0_6,axiom,
    f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
    ax3 ).

cnf(c_0_7,axiom,
    f(X1,one) = s(one),
    ax1 ).

cnf(c_0_8,plain,
    f(s(X1),s(one)) = f(X1,s(one)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    ( d(s(X1))
    | ~ d(X1) ),
    ax5 ).

cnf(c_0_10,axiom,
    f(one,s(X1)) = s(s(f(one,X1))),
    ax2 ).

cnf(c_0_11,plain,
    f(X1,f(X1,s(one))) = f(s(X1),s(s(one))),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_12,plain,
    ( d(f(one,s(X1)))
    | ~ d(s(f(one,X1))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    f(one,s(one)) = s(s(s(one))),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_14,plain,
    f(s(X1),f(X1,s(one))) = f(s(s(X1)),s(s(one))),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_15,plain,
    ( d(f(one,f(one,s(X1))))
    | ~ d(s(f(one,s(f(one,X1))))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_16,plain,
    f(s(one),s(s(one))) = f(one,s(s(s(one)))),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ d(f(s(s(one)),s(s(one)))),
    conj ).

cnf(c_0_18,plain,
    f(s(s(one)),s(s(one))) = f(s(one),s(s(s(one)))),
    inference(spm,[status(thm)],[c_0_14,c_0_13]) ).

cnf(c_0_19,plain,
    ( d(f(one,f(one,s(X1))))
    | ~ d(f(one,s(f(one,X1)))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

cnf(c_0_20,plain,
    f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
    inference(spm,[status(thm)],[c_0_6,c_0_16]) ).

cnf(c_0_21,plain,
    f(one,s(s(one))) = s(s(s(s(s(one))))),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_22,negated_conjecture,
    ~ d(f(s(one),s(s(s(one))))),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    ~ d(f(one,s(s(s(s(s(s(one)))))))),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).

cnf(c_0_24,plain,
    ~ d(s(f(one,s(s(s(s(s(one)))))))),
    inference(spm,[status(thm)],[c_0_23,c_0_12]) ).

cnf(c_0_25,plain,
    ~ d(f(one,s(s(s(s(s(one))))))),
    inference(spm,[status(thm)],[c_0_24,c_0_9]) ).

cnf(c_0_26,plain,
    ~ d(s(f(one,s(s(s(s(one))))))),
    inference(spm,[status(thm)],[c_0_25,c_0_12]) ).

cnf(c_0_27,plain,
    ~ d(f(one,s(s(s(s(one)))))),
    inference(spm,[status(thm)],[c_0_26,c_0_9]) ).

cnf(c_0_28,plain,
    ~ d(s(f(one,s(s(s(one)))))),
    inference(spm,[status(thm)],[c_0_27,c_0_12]) ).

cnf(c_0_29,plain,
    ~ d(f(one,s(s(s(one))))),
    inference(spm,[status(thm)],[c_0_28,c_0_9]) ).

cnf(c_0_30,plain,
    ( d(f(one,s(s(s(one)))))
    | ~ d(s(s(s(s(s(one)))))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_7]),c_0_21]) ).

cnf(c_0_31,plain,
    ~ d(s(s(s(s(s(one)))))),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,plain,
    ~ d(s(s(s(s(one))))),
    inference(spm,[status(thm)],[c_0_31,c_0_9]) ).

cnf(c_0_33,plain,
    ~ d(s(s(s(one)))),
    inference(spm,[status(thm)],[c_0_32,c_0_9]) ).

cnf(c_0_34,plain,
    ~ d(s(s(one))),
    inference(spm,[status(thm)],[c_0_33,c_0_9]) ).

cnf(c_0_35,plain,
    ~ d(s(one)),
    inference(spm,[status(thm)],[c_0_34,c_0_9]) ).

cnf(c_0_36,axiom,
    d(one),
    ax4 ).

cnf(c_0_37,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_9]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 08:00:52 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.007000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.009000 s
%------------------------------------------------------------------------------