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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL167-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 : n020.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:52:34 EDT 2023

% Result   : Unsatisfiable 0.74s 0.84s
% Output   : CNFRefutation 0.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   36
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   61 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :  125 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  140 (  71   ~;  69   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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   :  149 (   3 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(xhk,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xhk) ).

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

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(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2)))),
    xhk ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_27,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_20,c_0_25]) ).

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

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

cnf(c_0_30,plain,
    ( is_a_theorem(equivalent(X1,X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_28]) ).

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

cnf(c_0_32,plain,
    is_a_theorem(equivalent(X1,X1)),
    inference(spm,[status(thm)],[c_0_30,c_0_4]) ).

cnf(c_0_33,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

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

cnf(c_0_35,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_34]) ).

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

cnf(c_0_37,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X1),X2),X3),equivalent(X3,X2))),
    inference(spm,[status(thm)],[c_0_33,c_0_36]) ).

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

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

cnf(c_0_40,plain,
    is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(equivalent(X2,X3),X3),X2))),
    inference(spm,[status(thm)],[c_0_38,c_0_34]) ).

cnf(c_0_41,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
    inference(spm,[status(thm)],[c_0_39,c_0_4]) ).

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

cnf(c_0_43,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_40]),c_0_32])]) ).

cnf(c_0_44,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X2,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_41]) ).

cnf(c_0_45,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X3))
    | ~ is_a_theorem(equivalent(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_47,plain,
    ( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X3))
    | ~ is_a_theorem(equivalent(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_41]) ).

cnf(c_0_48,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(X3,X2),X3),X1))) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_49,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    inference(spm,[status(thm)],[c_0_48,c_0_4]) ).

cnf(c_0_50,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),X3))
    | ~ is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_49]) ).

cnf(c_0_51,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X3,X2)),X1)),
    inference(spm,[status(thm)],[c_0_50,c_0_34]) ).

cnf(c_0_52,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))),
    prove_yro ).

cnf(c_0_54,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X3,X2),X1)))),
    inference(spm,[status(thm)],[c_0_52,c_0_34]) ).

cnf(c_0_55,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL167-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n020.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   : Fri Aug 25 07:22:30 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.74/0.84  % Version  : CSE_E---1.5
% 0.74/0.84  % Problem  : theBenchmark.p
% 0.74/0.84  % Proof found
% 0.74/0.84  % SZS status Theorem for theBenchmark.p
% 0.74/0.85  % SZS output start Proof
% See solution above
% 0.74/0.85  % Total time : 0.274000 s
% 0.74/0.85  % SZS output end Proof
% 0.74/0.85  % Total time : 0.276000 s
%------------------------------------------------------------------------------