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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SET787-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n024.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 14:35:32 EDT 2023

% Result   : Unsatisfiable 29.60s 29.64s
% Output   : CNFRefutation 29.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   41 (  10 unt;  17 typ;   0 def)
%            Number of atoms       :   44 (  10 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (  19   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  13   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   4 con; 0-2 aty)
%            Number of variables   :   38 (   6 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

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

tff(decl_29,type,
    eptset: $i ).

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

tff(decl_31,type,
    converse: $i > $i ).

tff(decl_32,type,
    converseE_sk2: $i > $i ).

tff(decl_33,type,
    converseE_sk1: $i > $i ).

tff(decl_34,type,
    converse_sk1: $i > $i ).

tff(decl_35,type,
    converse_sk2: $i > $i ).

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

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

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

cnf(clause112,axiom,
    ( X1 = X2
    | member(X1,X3)
    | ~ member(X1,cons(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause112) ).

cnf(clause120,axiom,
    ( member(unionE_sk1(X1,X2),X2)
    | ~ member(X1,union(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).

cnf(clause158,axiom,
    ~ member(X1,eptset),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause158) ).

cnf(un_eq_Union_2_c1,negated_conjecture,
    member(sk2,union(cons(a,cons(b,eptset)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c1) ).

cnf(un_eq_Union_2_c2,negated_conjecture,
    ~ member(sk2,un(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c2) ).

cnf(unI2,axiom,
    ( member(X1,un(X3,X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unI2) ).

cnf(clause119,axiom,
    ( member(X1,unionE_sk1(X1,X2))
    | ~ member(X1,union(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause119) ).

cnf(unI1,axiom,
    ( member(X1,un(X2,X3))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unI1) ).

cnf(c_0_8,axiom,
    ( X1 = X2
    | member(X1,X3)
    | ~ member(X1,cons(X2,X3)) ),
    clause112 ).

cnf(c_0_9,axiom,
    ( member(unionE_sk1(X1,X2),X2)
    | ~ member(X1,union(X2)) ),
    clause120 ).

cnf(c_0_10,plain,
    ( unionE_sk1(X1,cons(X2,X3)) = X2
    | member(unionE_sk1(X1,cons(X2,X3)),X3)
    | ~ member(X1,union(cons(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    ~ member(X1,eptset),
    clause158 ).

cnf(c_0_12,plain,
    ( unionE_sk1(X1,cons(X2,cons(X3,X4))) = X2
    | unionE_sk1(X1,cons(X2,cons(X3,X4))) = X3
    | member(unionE_sk1(X1,cons(X2,cons(X3,X4))),X4)
    | ~ member(X1,union(cons(X2,cons(X3,X4)))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_13,plain,
    ( unionE_sk1(X1,cons(X2,cons(X3,eptset))) = X3
    | unionE_sk1(X1,cons(X2,cons(X3,eptset))) = X2
    | ~ member(X1,union(cons(X2,cons(X3,eptset)))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    member(sk2,union(cons(a,cons(b,eptset)))),
    un_eq_Union_2_c1 ).

cnf(c_0_15,negated_conjecture,
    ~ member(sk2,un(a,b)),
    un_eq_Union_2_c2 ).

cnf(c_0_16,axiom,
    ( member(X1,un(X3,X2))
    | ~ member(X1,X2) ),
    unI2 ).

cnf(c_0_17,axiom,
    ( member(X1,unionE_sk1(X1,X2))
    | ~ member(X1,union(X2)) ),
    clause119 ).

cnf(c_0_18,negated_conjecture,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = a
    | unionE_sk1(sk2,cons(a,cons(b,eptset))) = b ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ~ member(sk2,b),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,axiom,
    ( member(X1,un(X2,X3))
    | ~ member(X1,X2) ),
    unI1 ).

cnf(c_0_21,negated_conjecture,
    unionE_sk1(sk2,cons(a,cons(b,eptset))) = a,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ~ member(sk2,a),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET787-1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n024.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 10:18:09 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 29.60/29.64  % Version  : CSE_E---1.5
% 29.60/29.64  % Problem  : theBenchmark.p
% 29.60/29.64  % Proof found
% 29.60/29.64  % SZS status Theorem for theBenchmark.p
% 29.60/29.64  % SZS output start Proof
% See solution above
% 29.60/29.65  % Total time : 29.064000 s
% 29.60/29.65  % SZS output end Proof
% 29.60/29.65  % Total time : 29.068000 s
%------------------------------------------------------------------------------