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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN350-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n025.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 : Fri Sep  1 01:51:19 EDT 2023

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   36 (  17   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   31 (   4 sgn;   0   !;   0   ?;   0   :)

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

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

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

cnf(clause5,negated_conjecture,
    ( f(a,z(X1,X2))
    | f(X2,z(X1,X2))
    | ~ f(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause1,negated_conjecture,
    ( f(z(X1,X2),a)
    | ~ f(a,z(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(clause6,negated_conjecture,
    ( ~ f(a,z(X1,X2))
    | ~ f(X2,z(X1,X2))
    | ~ f(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause2,negated_conjecture,
    ( f(a,z(X1,X2))
    | ~ f(z(X1,X2),a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(clause3,negated_conjecture,
    ( f(a,z(X1,X2))
    | f(X2,z(X1,X2))
    | f(X1,z(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(c_0_5,negated_conjecture,
    ( f(a,z(X1,X2))
    | f(X2,z(X1,X2))
    | ~ f(X1,X2) ),
    clause5 ).

cnf(c_0_6,negated_conjecture,
    ( f(z(X1,X2),a)
    | ~ f(a,z(X1,X2)) ),
    clause1 ).

cnf(c_0_7,negated_conjecture,
    ( ~ f(a,z(X1,X2))
    | ~ f(X2,z(X1,X2))
    | ~ f(X1,X2) ),
    clause6 ).

cnf(c_0_8,negated_conjecture,
    ( f(a,z(z(X1,X2),a))
    | ~ f(a,z(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ( f(a,z(X1,X2))
    | ~ f(z(X1,X2),a) ),
    clause2 ).

cnf(c_0_10,negated_conjecture,
    ( ~ f(a,z(z(X1,X2),a))
    | ~ f(z(X1,X2),a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    ~ f(z(X1,X2),a),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( f(a,z(X1,X2))
    | f(X2,z(X1,X2))
    | f(X1,z(X1,X2)) ),
    clause3 ).

cnf(c_0_13,negated_conjecture,
    ~ f(a,z(X1,X2)),
    inference(spm,[status(thm)],[c_0_11,c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    ( f(X1,z(X1,X2))
    | f(X2,z(X1,X2)) ),
    inference(sr,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    f(X1,z(X1,a)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_13,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN350-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n025.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 20:23:23 EDT 2023
% 0.19/0.34  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.004000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.007000 s
%------------------------------------------------------------------------------