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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL018-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 : n013.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:48 EDT 2023

% Result   : Unsatisfiable 0.19s 0.63s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   60 (  31   ~;  29   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   85 (   1 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

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

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

cnf(c_0_3,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_4,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X3,X1))),
    pym ).

cnf(c_0_5,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),X3)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X3,X2),X1),X3)))),
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

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

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

cnf(c_0_9,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_3,c_0_8]) ).

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

cnf(c_0_11,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_4]) ).

cnf(c_0_12,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_5,c_0_11]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X2)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X1),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_6]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X1),X3))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_6]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_17]) ).

cnf(c_0_19,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X3),X2)),X3)),
    inference(spm,[status(thm)],[c_0_18,c_0_6]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_7]) ).

cnf(c_0_21,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X3,X1)),X3),X2))),
    inference(spm,[status(thm)],[c_0_15,c_0_19]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X2))
    | ~ is_a_theorem(equivalent(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_4]) ).

cnf(c_0_23,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),X1),X3)),
    inference(spm,[status(thm)],[c_0_18,c_0_21]) ).

cnf(c_0_24,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(X3,equivalent(X2,X1))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_25,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),equivalent(X3,X2)),X3))),
    inference(spm,[status(thm)],[c_0_5,c_0_23]) ).

cnf(c_0_26,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X1,X2)),X3))),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),X2),X3)),
    inference(spm,[status(thm)],[c_0_18,c_0_26]) ).

cnf(c_0_28,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))),
    inference(spm,[status(thm)],[c_0_5,c_0_27]) ).

cnf(c_0_29,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,X3)),X3))),
    inference(spm,[status(thm)],[c_0_24,c_0_28]) ).

cnf(c_0_30,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
    prove_pyo ).

cnf(c_0_31,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X3),equivalent(X2,X1))),
    inference(spm,[status(thm)],[c_0_18,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL018-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Thu Aug 24 18:15:17 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.59  start to proof: theBenchmark
% 0.19/0.63  % Version  : CSE_E---1.5
% 0.19/0.63  % Problem  : theBenchmark.p
% 0.19/0.63  % Proof found
% 0.19/0.63  % SZS status Theorem for theBenchmark.p
% 0.19/0.63  % SZS output start Proof
% See solution above
% 0.19/0.63  % Total time : 0.033000 s
% 0.19/0.63  % SZS output end Proof
% 0.19/0.63  % Total time : 0.036000 s
%------------------------------------------------------------------------------