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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SET011-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 : n001.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:32:00 EDT 2023

% Result   : Unsatisfiable 0.19s 0.60s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   46 (   9 unt;  12 typ;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   86 (  35   ~;  51   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (   8   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   60 (   4 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

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

tff(decl_29,type,
    k: ( $i * $i * $i ) > $i ).

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

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

tff(decl_32,type,
    aDb: $i ).

tff(decl_33,type,
    aD_aDb: $i ).

cnf(member_of_difference,axiom,
    ( member(X4,X1)
    | ~ difference(X1,X2,X3)
    | ~ member(X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',member_of_difference) ).

cnf(a_minus_aDb,hypothesis,
    difference(a,aDb,aD_aDb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_minus_aDb) ).

cnf(not_member_of_difference,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,X3)
    | ~ difference(X4,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',not_member_of_difference) ).

cnf(member_of_difference_or_set2,axiom,
    ( member(X1,X4)
    | member(X1,X3)
    | ~ member(X1,X2)
    | ~ difference(X2,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',member_of_difference_or_set2) ).

cnf(intersection_axiom1,axiom,
    ( member(h(X1,X2,X3),X3)
    | intersection(X1,X2,X3)
    | member(h(X1,X2,X3),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom1) ).

cnf(intersection_axiom2,axiom,
    ( member(h(X1,X2,X3),X3)
    | intersection(X1,X2,X3)
    | member(h(X1,X2,X3),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom2) ).

cnf(a_minus_b,hypothesis,
    difference(a,b,aDb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_minus_b) ).

cnf(intersection_axiom3,axiom,
    ( intersection(X1,X2,X3)
    | ~ member(h(X1,X2,X3),X3)
    | ~ member(h(X1,X2,X3),X2)
    | ~ member(h(X1,X2,X3),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom3) ).

cnf(prove_a_intersection_b_is_aD_aDb,negated_conjecture,
    ~ intersection(a,b,aD_aDb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_intersection_b_is_aD_aDb) ).

cnf(c_0_9,axiom,
    ( member(X4,X1)
    | ~ difference(X1,X2,X3)
    | ~ member(X4,X3) ),
    member_of_difference ).

cnf(c_0_10,hypothesis,
    difference(a,aDb,aD_aDb),
    a_minus_aDb ).

cnf(c_0_11,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,X3)
    | ~ difference(X4,X2,X3) ),
    not_member_of_difference ).

cnf(c_0_12,axiom,
    ( member(X1,X4)
    | member(X1,X3)
    | ~ member(X1,X2)
    | ~ difference(X2,X3,X4) ),
    member_of_difference_or_set2 ).

cnf(c_0_13,hypothesis,
    ( member(X1,a)
    | ~ member(X1,aD_aDb) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,axiom,
    ( member(h(X1,X2,X3),X3)
    | intersection(X1,X2,X3)
    | member(h(X1,X2,X3),X1) ),
    intersection_axiom1 ).

cnf(c_0_15,hypothesis,
    ( ~ member(X1,aD_aDb)
    | ~ member(X1,aDb) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_16,axiom,
    ( member(h(X1,X2,X3),X3)
    | intersection(X1,X2,X3)
    | member(h(X1,X2,X3),X2) ),
    intersection_axiom2 ).

cnf(c_0_17,hypothesis,
    difference(a,b,aDb),
    a_minus_b ).

cnf(c_0_18,axiom,
    ( intersection(X1,X2,X3)
    | ~ member(h(X1,X2,X3),X3)
    | ~ member(h(X1,X2,X3),X2)
    | ~ member(h(X1,X2,X3),X1) ),
    intersection_axiom3 ).

cnf(c_0_19,hypothesis,
    ( member(X1,aDb)
    | member(X1,aD_aDb)
    | ~ member(X1,a) ),
    inference(spm,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_20,hypothesis,
    ( intersection(X1,X2,aD_aDb)
    | member(h(X1,X2,aD_aDb),a)
    | member(h(X1,X2,aD_aDb),X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,hypothesis,
    ( intersection(X1,X2,aD_aDb)
    | member(h(X1,X2,aD_aDb),X2)
    | ~ member(h(X1,X2,aD_aDb),aDb) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,hypothesis,
    ( member(X1,b)
    | member(X1,aDb)
    | ~ member(X1,a) ),
    inference(spm,[status(thm)],[c_0_12,c_0_17]) ).

cnf(c_0_23,hypothesis,
    ( intersection(X1,X2,aD_aDb)
    | member(h(X1,X2,aD_aDb),a)
    | member(h(X1,X2,aD_aDb),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_16]) ).

cnf(c_0_24,hypothesis,
    ( intersection(X1,X2,aD_aDb)
    | member(h(X1,X2,aD_aDb),aDb)
    | ~ member(h(X1,X2,aD_aDb),a)
    | ~ member(h(X1,X2,aD_aDb),X2)
    | ~ member(h(X1,X2,aD_aDb),X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,hypothesis,
    ( intersection(a,X1,aD_aDb)
    | member(h(a,X1,aD_aDb),a) ),
    inference(ef,[status(thm)],[c_0_20]) ).

cnf(c_0_26,hypothesis,
    ( intersection(X1,X2,aD_aDb)
    | member(h(X1,X2,aD_aDb),b)
    | member(h(X1,X2,aD_aDb),X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_27,hypothesis,
    ( intersection(a,X1,aD_aDb)
    | member(h(a,X1,aD_aDb),aDb)
    | ~ member(h(a,X1,aD_aDb),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).

cnf(c_0_28,hypothesis,
    ( intersection(X1,b,aD_aDb)
    | member(h(X1,b,aD_aDb),b) ),
    inference(ef,[status(thm)],[c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    ~ intersection(a,b,aD_aDb),
    prove_a_intersection_b_is_aD_aDb ).

cnf(c_0_30,hypothesis,
    ( ~ member(X1,aDb)
    | ~ member(X1,b) ),
    inference(spm,[status(thm)],[c_0_11,c_0_17]) ).

cnf(c_0_31,hypothesis,
    member(h(a,b,aD_aDb),aDb),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_32,hypothesis,
    ~ member(h(a,b,aD_aDb),b),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n001.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sat Aug 26 10:21:00 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.60  % Version  : CSE_E---1.5
% 0.19/0.60  % Problem  : theBenchmark.p
% 0.19/0.60  % Proof found
% 0.19/0.60  % SZS status Theorem for theBenchmark.p
% 0.19/0.60  % SZS output start Proof
% See solution above
% 0.19/0.61  % Total time : 0.030000 s
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time : 0.033000 s
%------------------------------------------------------------------------------