TSTP Solution File: SYN563-10 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN563-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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:53:14 EDT 2023

% Result   : Unsatisfiable 0.19s 0.73s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   56 (  44 unt;  12 typ;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   16 (   7   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-4 aty)
%            Number of variables   :   61 (   4 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

tff(decl_27,type,
    c7: $i ).

tff(decl_28,type,
    f4: $i > $i ).

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

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

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

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

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

cnf(p6_16,negated_conjecture,
    ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_16) ).

cnf(p6_2,negated_conjecture,
    p6(X1,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_2) ).

cnf(ifeq_axiom,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(p6_10,negated_conjecture,
    ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_10) ).

cnf(p5_7,negated_conjecture,
    p5(f3(f3(X1)),f3(f4(X1))) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_7) ).

cnf(p2_1,negated_conjecture,
    p2(X1,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_1) ).

cnf(p2_11,negated_conjecture,
    ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_11) ).

cnf(p2_4,negated_conjecture,
    p2(f4(c7),f4(c8)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

cnf(p6_9,negated_conjecture,
    ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_9) ).

cnf(p6_14,negated_conjecture,
    ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_14) ).

cnf(p5_15,negated_conjecture,
    ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_15) ).

cnf(p5_8,negated_conjecture,
    ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_8) ).

cnf(not_p6_5,negated_conjecture,
    ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p6_5) ).

cnf(ifeq_axiom_001,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).

cnf(goal,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c_0_15,negated_conjecture,
    ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
    p6_16 ).

cnf(c_0_16,negated_conjecture,
    p6(X1,X1) = true,
    p6_2 ).

cnf(c_0_17,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_18,negated_conjecture,
    ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
    p6_10 ).

cnf(c_0_19,negated_conjecture,
    p5(f3(f3(X1)),f3(f4(X1))) = true,
    p5_7 ).

cnf(c_0_20,negated_conjecture,
    ifeq2(p2(X1,X2),true,ifeq2(p2(X1,X3),true,p6(X3,X2),true),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    p2(X1,X1) = true,
    p2_1 ).

cnf(c_0_22,negated_conjecture,
    ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
    p2_11 ).

cnf(c_0_23,negated_conjecture,
    p2(f4(c7),f4(c8)) = true,
    p2_4 ).

cnf(c_0_24,negated_conjecture,
    ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
    p6_9 ).

cnf(c_0_25,negated_conjecture,
    ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
    p6_14 ).

cnf(c_0_26,negated_conjecture,
    p6(f4(f3(f3(X1))),f3(f4(X1))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).

cnf(c_0_27,negated_conjecture,
    ifeq2(p2(X1,X2),true,p6(X1,X2),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    p2(f3(f4(c7)),f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).

cnf(c_0_29,negated_conjecture,
    p6(c7,f3(c7)) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17]) ).

cnf(c_0_30,negated_conjecture,
    ifeq2(p6(f3(f4(X1)),X2),true,p6(f4(f3(f3(X1))),X2),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]) ).

cnf(c_0_31,negated_conjecture,
    p6(f3(f4(c7)),f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17]) ).

cnf(c_0_32,negated_conjecture,
    ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
    p5_15 ).

cnf(c_0_33,negated_conjecture,
    p6(c7,f3(f3(c7))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_17]) ).

cnf(c_0_34,negated_conjecture,
    ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
    p5_8 ).

cnf(c_0_35,negated_conjecture,
    p6(f4(f3(f3(c7))),f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]) ).

cnf(c_0_36,negated_conjecture,
    ifeq2(p5(f3(f3(c7)),X1),true,p5(c7,X1),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17]) ).

cnf(c_0_37,negated_conjecture,
    p5(f3(f3(c7)),f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]) ).

cnf(c_0_38,negated_conjecture,
    p5(c7,f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]) ).

cnf(c_0_39,negated_conjecture,
    ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
    not_p6_5 ).

cnf(c_0_40,negated_conjecture,
    p6(f4(c7),f3(f4(c8))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_38]),c_0_17]) ).

cnf(c_0_41,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom_001 ).

cnf(c_0_42,negated_conjecture,
    a != b,
    goal ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN563-10 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox2/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 17:43:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.73  % Version  : CSE_E---1.5
% 0.19/0.73  % Problem  : theBenchmark.p
% 0.19/0.73  % Proof found
% 0.19/0.73  % SZS status Theorem for theBenchmark.p
% 0.19/0.73  % SZS output start Proof
% See solution above
% 0.19/0.73  % Total time : 0.161000 s
% 0.19/0.73  % SZS output end Proof
% 0.19/0.73  % Total time : 0.164000 s
%------------------------------------------------------------------------------