TSTP Solution File: SYN084-2 by CSE_E---1.5

View Problem - Process Solution

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

% Computer : n016.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:50:02 EDT 2023

% Result   : Unsatisfiable 0.20s 0.57s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   36 (   8 unt;   5 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   73 (  37   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :    6 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

tff(decl_25,type,
    sk1: $i ).

tff(decl_26,type,
    sk2: $i ).

cnf(pel62_3,negated_conjecture,
    ( big_p(f(f(X1)))
    | ~ big_p(f(X1))
    | ~ big_p(a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_3) ).

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

cnf(pel62_4,negated_conjecture,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(f(f(sk2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_4) ).

cnf(pel62_2,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(X1)
    | ~ big_p(a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_2) ).

cnf(pel62_6,negated_conjecture,
    ( big_p(f(sk1))
    | ~ big_p(sk1)
    | ~ big_p(f(f(sk2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_6) ).

cnf(pel62_7,negated_conjecture,
    ( big_p(f(sk2))
    | ~ big_p(sk2)
    | ~ big_p(f(f(sk1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_7) ).

cnf(pel62_5,negated_conjecture,
    ( big_p(f(sk1))
    | big_p(f(sk2))
    | ~ big_p(sk1)
    | ~ big_p(sk2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_5) ).

cnf(c_0_7,negated_conjecture,
    ( big_p(f(f(X1)))
    | ~ big_p(f(X1))
    | ~ big_p(a) ),
    pel62_3 ).

cnf(c_0_8,negated_conjecture,
    big_p(a),
    pel62_1 ).

cnf(c_0_9,negated_conjecture,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(f(f(sk2))) ),
    pel62_4 ).

cnf(c_0_10,negated_conjecture,
    ( big_p(f(f(X1)))
    | ~ big_p(f(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(f(sk2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(X1)
    | ~ big_p(a) ),
    pel62_2 ).

cnf(c_0_13,negated_conjecture,
    ( big_p(f(sk1))
    | ~ big_p(sk1)
    | ~ big_p(f(f(sk2))) ),
    pel62_6 ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_p(f(sk2))
    | ~ big_p(f(sk1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( big_p(f(f(X1)))
    | big_p(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ big_p(f(sk2))
    | ~ big_p(sk1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ( big_p(sk2)
    | ~ big_p(f(f(sk1))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( big_p(f(sk2))
    | ~ big_p(sk2)
    | ~ big_p(f(f(sk1))) ),
    pel62_7 ).

cnf(c_0_19,negated_conjecture,
    ~ big_p(f(sk2)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( big_p(sk1)
    | big_p(sk2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ( big_p(f(sk1))
    | big_p(f(sk2))
    | ~ big_p(sk1)
    | ~ big_p(sk2) ),
    pel62_5 ).

cnf(c_0_22,negated_conjecture,
    big_p(sk1),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    ( big_p(f(sk1))
    | ~ big_p(sk1)
    | ~ big_p(sk2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( big_p(f(sk1))
    | ~ big_p(f(f(sk2))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    ( big_p(f(sk1))
    | ~ big_p(sk2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).

cnf(c_0_26,negated_conjecture,
    ( big_p(sk2)
    | ~ big_p(f(sk1)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_10]) ).

cnf(c_0_27,negated_conjecture,
    big_p(f(sk1)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    big_p(sk2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

cnf(c_0_29,negated_conjecture,
    ~ big_p(f(f(sk1))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_28])]),c_0_19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN084-2 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n016.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 20:34:42 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.57  % Version  : CSE_E---1.5
% 0.20/0.57  % Problem  : theBenchmark.p
% 0.20/0.57  % Proof found
% 0.20/0.57  % SZS status Theorem for theBenchmark.p
% 0.20/0.57  % SZS output start Proof
% See solution above
% 0.20/0.57  % Total time : 0.004000 s
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  % Total time : 0.007000 s
%------------------------------------------------------------------------------