TSTP Solution File: LCL042-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL042-1 : 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 : n014.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 : Thu Aug 31 06:51:56 EDT 2023

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

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

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

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

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

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

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

cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_22,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_22) ).

cnf(cn_21,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).

cnf(cn_54,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(prove_cn_35,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_35) ).

cnf(c_0_6,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_7,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
    cn_22 ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    cn_21 ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,X3))
    | ~ is_a_theorem(implies(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_9]) ).

cnf(c_0_12,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    cn_54 ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(implies(implies(implies(X4,X1),implies(X4,X2)),X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_14,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_16,plain,
    ( is_a_theorem(implies(implies(X1,implies(X2,X3)),X4))
    | ~ is_a_theorem(implies(implies(X2,implies(X1,X3)),X4)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X4)))
    | ~ is_a_theorem(implies(implies(X3,X2),X4)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X1),X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_14]) ).

cnf(c_0_19,plain,
    is_a_theorem(implies(not(X1),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    prove_cn_35 ).

cnf(c_0_21,plain,
    ( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),X5)))
    | ~ is_a_theorem(implies(implies(X4,implies(X1,X3)),X5)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15  % Problem    : LCL042-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.16  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.37  % Computer : n014.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Fri Aug 25 06:52:48 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 0.21/0.61  start to proof: theBenchmark
% 163.32/163.30  % Version  : CSE_E---1.5
% 163.32/163.30  % Problem  : theBenchmark.p
% 163.32/163.30  % Proof found
% 163.32/163.30  % SZS status Theorem for theBenchmark.p
% 163.32/163.30  % SZS output start Proof
% See solution above
% 163.32/163.31  % Total time : 162.693000 s
% 163.32/163.31  % SZS output end Proof
% 163.32/163.31  % Total time : 162.702000 s
%------------------------------------------------------------------------------