TSTP Solution File: SYN005-1.010 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN005-1.010 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n007.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 01:48:24 EDT 2023

% Result   : Unsatisfiable 0.19s 0.54s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   42 (  21 unt;  11 typ;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  118 (  64   ~;  54   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  10   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   56 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

tff(decl_27,type,
    p_6: ( $i * $i ) > $o ).

tff(decl_28,type,
    p_7: ( $i * $i ) > $o ).

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

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

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

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

cnf(disjunction,negated_conjecture,
    ( ~ p_1(X1,X2)
    | ~ p_2(X2,X3)
    | ~ p_3(X3,X4)
    | ~ p_4(X4,X5)
    | ~ p_5(X5,X6)
    | ~ p_6(X6,X7)
    | ~ p_7(X7,X8)
    | ~ p_8(X8,X9)
    | ~ p_9(X9,X10)
    | ~ p_10(X10,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjunction) ).

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

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

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

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

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

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

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

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

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

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

cnf(c_0_11,negated_conjecture,
    ( ~ p_1(X1,X2)
    | ~ p_2(X2,X3)
    | ~ p_3(X3,X4)
    | ~ p_4(X4,X5)
    | ~ p_5(X5,X6)
    | ~ p_6(X6,X7)
    | ~ p_7(X7,X8)
    | ~ p_8(X8,X9)
    | ~ p_9(X9,X10)
    | ~ p_10(X10,X1) ),
    disjunction ).

cnf(c_0_12,negated_conjecture,
    p_10(a,a),
    p_10 ).

cnf(c_0_13,negated_conjecture,
    ( ~ p_9(X1,a)
    | ~ p_8(X2,X1)
    | ~ p_7(X3,X2)
    | ~ p_6(X4,X3)
    | ~ p_5(X5,X4)
    | ~ p_4(X6,X5)
    | ~ p_3(X7,X6)
    | ~ p_2(X8,X7)
    | ~ p_1(a,X8) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    p_9(a,a),
    p_9 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p_8(X1,a)
    | ~ p_7(X2,X1)
    | ~ p_6(X3,X2)
    | ~ p_5(X4,X3)
    | ~ p_4(X5,X4)
    | ~ p_3(X6,X5)
    | ~ p_2(X7,X6)
    | ~ p_1(a,X7) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    p_8(a,a),
    p_8 ).

cnf(c_0_17,negated_conjecture,
    ( ~ p_7(X1,a)
    | ~ p_6(X2,X1)
    | ~ p_5(X3,X2)
    | ~ p_4(X4,X3)
    | ~ p_3(X5,X4)
    | ~ p_2(X6,X5)
    | ~ p_1(a,X6) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    p_7(a,a),
    p_7 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p_6(X1,a)
    | ~ p_5(X2,X1)
    | ~ p_4(X3,X2)
    | ~ p_3(X4,X3)
    | ~ p_2(X5,X4)
    | ~ p_1(a,X5) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    p_6(a,a),
    p_6 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p_5(X1,a)
    | ~ p_4(X2,X1)
    | ~ p_3(X3,X2)
    | ~ p_2(X4,X3)
    | ~ p_1(a,X4) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    p_5(a,a),
    p_5 ).

cnf(c_0_23,negated_conjecture,
    ( ~ p_4(X1,a)
    | ~ p_3(X2,X1)
    | ~ p_2(X3,X2)
    | ~ p_1(a,X3) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    p_4(a,a),
    p_4 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p_3(X1,a)
    | ~ p_2(X2,X1)
    | ~ p_1(a,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,negated_conjecture,
    p_3(a,a),
    p_3 ).

cnf(c_0_27,negated_conjecture,
    ( ~ p_2(X1,a)
    | ~ p_1(a,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    p_2(a,a),
    p_2 ).

cnf(c_0_29,negated_conjecture,
    p_1(a,a),
    p_1 ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN005-1.010 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sat Aug 26 20:42:57 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.53  start to proof: theBenchmark
% 0.19/0.54  % Version  : CSE_E---1.5
% 0.19/0.54  % Problem  : theBenchmark.p
% 0.19/0.54  % Proof found
% 0.19/0.54  % SZS status Theorem for theBenchmark.p
% 0.19/0.54  % SZS output start Proof
% See solution above
% 0.19/0.54  % Total time : 0.004000 s
% 0.19/0.54  % SZS output end Proof
% 0.19/0.54  % Total time : 0.007000 s
%------------------------------------------------------------------------------