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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : BOO074-1 : TPTP v8.1.2. Released v2.6.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 : Wed Aug 30 18:06:05 EDT 2023

% Result   : Unsatisfiable 1.04s 1.13s
% Output   : CNFRefutation 1.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   44 (  40 unt;   4 typ;   0 def)
%            Number of atoms       :   40 (  39 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :   13 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   63 (  13 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

cnf(dn1,axiom,
    inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dn1) ).

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

cnf(c_0_2,axiom,
    inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
    dn1 ).

cnf(c_0_3,plain,
    inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(X1))),X1)) = inverse(X1),
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_4,plain,
    inverse(add(inverse(add(X1,inverse(X1))),X1)) = inverse(X1),
    inference(spm,[status(thm)],[c_0_3,c_0_2]) ).

cnf(c_0_5,plain,
    inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
    inference(spm,[status(thm)],[c_0_2,c_0_4]) ).

cnf(c_0_6,plain,
    inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,X3)))) = X3,
    inference(spm,[status(thm)],[c_0_2,c_0_5]) ).

cnf(c_0_7,plain,
    inverse(add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2)))) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_5]) ).

cnf(c_0_8,plain,
    inverse(add(inverse(add(add(X1,inverse(X1)),X1)),inverse(X1))) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_9,plain,
    inverse(add(X1,inverse(add(add(X1,inverse(X1)),inverse(X1))))) = inverse(X1),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_10,plain,
    inverse(add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2)))) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_9]) ).

cnf(c_0_11,plain,
    inverse(add(X1,inverse(add(inverse(X2),inverse(add(X2,X1)))))) = inverse(add(X2,X1)),
    inference(spm,[status(thm)],[c_0_6,c_0_10]) ).

cnf(c_0_12,plain,
    inverse(add(X1,inverse(inverse(X1)))) = inverse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_11]) ).

cnf(c_0_13,plain,
    inverse(add(inverse(add(X1,inverse(inverse(inverse(X1))))),inverse(inverse(X1)))) = inverse(inverse(inverse(X1))),
    inference(spm,[status(thm)],[c_0_7,c_0_12]) ).

cnf(c_0_14,plain,
    inverse(add(inverse(inverse(inverse(X1))),inverse(X1))) = inverse(inverse(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_12]) ).

cnf(c_0_15,plain,
    inverse(add(inverse(inverse(X1)),X1)) = inverse(X1),
    inference(spm,[status(thm)],[c_0_14,c_0_2]) ).

cnf(c_0_16,plain,
    inverse(add(inverse(X1),inverse(add(X1,X1)))) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_5]) ).

cnf(c_0_17,plain,
    inverse(add(inverse(add(inverse(X1),X1)),inverse(X1))) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_15]) ).

cnf(c_0_18,plain,
    inverse(add(inverse(add(X1,inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
    inference(spm,[status(thm)],[c_0_7,c_0_16]) ).

cnf(c_0_19,plain,
    inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(X1))))))) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_20,plain,
    inverse(add(X1,inverse(add(inverse(X1),inverse(X1))))) = inverse(X1),
    inference(spm,[status(thm)],[c_0_6,c_0_17]) ).

cnf(c_0_21,plain,
    inverse(add(inverse(add(X1,X1)),inverse(add(X1,X1)))) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_18]) ).

cnf(c_0_22,plain,
    inverse(add(inverse(X1),inverse(X1))) = X1,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    add(X1,X1) = X1,
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,plain,
    inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(X1))) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_23]) ).

cnf(c_0_25,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    inverse(add(X1,add(X2,X1))) = inverse(add(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_6]),c_0_25]) ).

cnf(c_0_27,plain,
    add(X1,add(X2,X1)) = add(X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_23]),c_0_26]),c_0_23]),c_0_25]) ).

cnf(c_0_28,plain,
    add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2))) = inverse(X2),
    inference(spm,[status(thm)],[c_0_25,c_0_10]) ).

cnf(c_0_29,plain,
    add(X1,inverse(add(inverse(X2),inverse(add(X2,X1))))) = add(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_11]),c_0_25]) ).

cnf(c_0_30,plain,
    add(inverse(add(X1,X2)),inverse(X2)) = inverse(X2),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X3,X1)))) = X3,
    inference(spm,[status(thm)],[c_0_2,c_0_29]) ).

cnf(c_0_32,plain,
    add(inverse(add(X1,inverse(X2))),X2) = X2,
    inference(spm,[status(thm)],[c_0_30,c_0_25]) ).

cnf(c_0_33,plain,
    inverse(add(inverse(X1),inverse(add(X1,X2)))) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
    huntinton_3 ).

cnf(c_0_35,plain,
    add(X1,X2) = add(X2,X1),
    inference(rw,[status(thm)],[c_0_29,c_0_33]) ).

cnf(c_0_36,plain,
    add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2))) = inverse(X2),
    inference(spm,[status(thm)],[c_0_25,c_0_7]) ).

cnf(c_0_37,negated_conjecture,
    add(inverse(add(b,inverse(a))),inverse(add(inverse(a),inverse(b)))) != a,
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    add(inverse(add(X1,X2)),inverse(add(X2,inverse(X1)))) = inverse(X2),
    inference(spm,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : BOO074-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n011.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   : Sun Aug 27 08:32:54 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 1.04/1.13  % Version  : CSE_E---1.5
% 1.04/1.13  % Problem  : theBenchmark.p
% 1.04/1.13  % Proof found
% 1.04/1.13  % SZS status Theorem for theBenchmark.p
% 1.04/1.13  % SZS output start Proof
% See solution above
% 1.04/1.13  % Total time : 0.555000 s
% 1.04/1.13  % SZS output end Proof
% 1.04/1.13  % Total time : 0.558000 s
%------------------------------------------------------------------------------