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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN069-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 : n023.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:49:54 EDT 2023

% Result   : Unsatisfiable 0.54s 0.58s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   38 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   94 (  46   ~;  48   |;   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  :   10 (   8   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (   0 sgn;   0   !;   0   ?;   0   :)

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

tff(decl_23,type,
    f: $i > $i ).

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

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

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

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

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

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

tff(decl_30,type,
    g: $i > $i ).

cnf(clause_4,axiom,
    ( ~ big_l(X1)
    | ~ big_k(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_6,axiom,
    ( big_l(X1)
    | ~ big_h(a,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_1,axiom,
    ( big_g(f(X1))
    | big_k(X2)
    | ~ big_f(X1)
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_9,negated_conjecture,
    ( big_h(X1,g(X1))
    | ~ big_f(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_8,negated_conjecture,
    ( big_g(g(X1))
    | ~ big_f(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_2,axiom,
    ( big_h(X1,f(X1))
    | big_k(X2)
    | ~ big_f(X1)
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_5,axiom,
    big_f(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_3,axiom,
    ( big_k(X2)
    | ~ big_f(X1)
    | ~ big_j(X1,f(X1))
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_7,axiom,
    ( big_j(a,X1)
    | ~ big_g(X1)
    | ~ big_h(a,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(c_0_9,axiom,
    ( ~ big_l(X1)
    | ~ big_k(X1) ),
    clause_4 ).

cnf(c_0_10,axiom,
    ( big_l(X1)
    | ~ big_h(a,X1) ),
    clause_6 ).

cnf(c_0_11,axiom,
    ( big_g(f(X1))
    | big_k(X2)
    | ~ big_f(X1)
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    clause_1 ).

cnf(c_0_12,negated_conjecture,
    ( big_h(X1,g(X1))
    | ~ big_f(X1) ),
    clause_9 ).

cnf(c_0_13,negated_conjecture,
    ( big_g(g(X1))
    | ~ big_f(X1) ),
    clause_8 ).

cnf(c_0_14,axiom,
    ( big_h(X1,f(X1))
    | big_k(X2)
    | ~ big_f(X1)
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    clause_2 ).

cnf(c_0_15,plain,
    ( ~ big_k(X1)
    | ~ big_h(a,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ( big_k(g(X1))
    | big_g(f(X1))
    | ~ big_f(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( big_k(g(X1))
    | big_h(X1,f(X1))
    | ~ big_f(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).

cnf(c_0_18,axiom,
    big_f(a),
    clause_5 ).

cnf(c_0_19,negated_conjecture,
    ( big_g(f(X1))
    | ~ big_h(a,g(X1))
    | ~ big_f(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( big_k(g(a))
    | big_h(a,f(a)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,axiom,
    ( big_k(X2)
    | ~ big_f(X1)
    | ~ big_j(X1,f(X1))
    | ~ big_g(X2)
    | ~ big_h(X1,X2) ),
    clause_3 ).

cnf(c_0_22,axiom,
    ( big_j(a,X1)
    | ~ big_g(X1)
    | ~ big_h(a,X1) ),
    clause_7 ).

cnf(c_0_23,negated_conjecture,
    big_g(f(a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_18])]) ).

cnf(c_0_24,negated_conjecture,
    ( big_h(a,f(a))
    | ~ big_h(a,g(a)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

cnf(c_0_25,plain,
    ( ~ big_h(a,f(a))
    | ~ big_h(a,X1)
    | ~ big_g(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_23])]),c_0_15]) ).

cnf(c_0_26,negated_conjecture,
    big_h(a,f(a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_18])]) ).

cnf(c_0_27,plain,
    ( ~ big_h(a,X1)
    | ~ big_g(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN069-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 19:08:11 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.53/0.57  start to proof: theBenchmark
% 0.54/0.58  % Version  : CSE_E---1.5
% 0.54/0.58  % Problem  : theBenchmark.p
% 0.54/0.58  % Proof found
% 0.54/0.58  % SZS status Theorem for theBenchmark.p
% 0.54/0.58  % SZS output start Proof
% See solution above
% 0.54/0.58  % Total time : 0.004000 s
% 0.54/0.58  % SZS output end Proof
% 0.54/0.58  % Total time : 0.007000 s
%------------------------------------------------------------------------------