TSTP Solution File: SET047-5 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SET047-5 : 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 : n011.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:30 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   28 (   4 unt;   5 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   52 (  22   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

cnf(element_substitution1,axiom,
    ( element(X3,X2)
    | ~ set_equal(X1,X2)
    | ~ element(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitution1) ).

cnf(prove_symmetry1,negated_conjecture,
    ( set_equal(a,b)
    | set_equal(b,a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetry1) ).

cnf(element_substitution2,axiom,
    ( element(X3,X1)
    | ~ set_equal(X1,X2)
    | ~ element(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitution2) ).

cnf(clause_3,axiom,
    ( element(f(X1,X2),X1)
    | element(f(X1,X2),X2)
    | set_equal(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_4,axiom,
    ( set_equal(X1,X2)
    | ~ element(f(X1,X2),X2)
    | ~ element(f(X1,X2),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(prove_symmetry2,negated_conjecture,
    ( ~ set_equal(b,a)
    | ~ set_equal(a,b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetry2) ).

cnf(c_0_6,axiom,
    ( element(X3,X2)
    | ~ set_equal(X1,X2)
    | ~ element(X3,X1) ),
    element_substitution1 ).

cnf(c_0_7,negated_conjecture,
    ( set_equal(a,b)
    | set_equal(b,a) ),
    prove_symmetry1 ).

cnf(c_0_8,axiom,
    ( element(X3,X1)
    | ~ set_equal(X1,X2)
    | ~ element(X3,X2) ),
    element_substitution2 ).

cnf(c_0_9,negated_conjecture,
    ( element(X1,b)
    | ~ element(X1,a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_10,axiom,
    ( element(f(X1,X2),X1)
    | element(f(X1,X2),X2)
    | set_equal(X1,X2) ),
    clause_3 ).

cnf(c_0_11,negated_conjecture,
    ( element(f(a,X1),b)
    | element(f(a,X1),X1)
    | set_equal(a,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,axiom,
    ( set_equal(X1,X2)
    | ~ element(f(X1,X2),X2)
    | ~ element(f(X1,X2),X1) ),
    clause_4 ).

cnf(c_0_13,negated_conjecture,
    ( element(f(a,b),b)
    | set_equal(a,b) ),
    inference(ef,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ( set_equal(a,b)
    | ~ element(f(a,b),a) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    ( element(X1,a)
    | ~ element(X1,b) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ set_equal(b,a)
    | ~ set_equal(a,b) ),
    prove_symmetry2 ).

cnf(c_0_17,negated_conjecture,
    set_equal(a,b),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( element(f(X1,a),b)
    | element(f(X1,a),X1)
    | set_equal(X1,a) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    ~ set_equal(b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_20,negated_conjecture,
    ( set_equal(X1,a)
    | ~ element(f(X1,a),b)
    | ~ element(f(X1,a),X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    element(f(b,a),b),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_18]),c_0_19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET047-5 : 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.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 09:57:24 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.004000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.006000 s
%------------------------------------------------------------------------------