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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : RNG128-1 : TPTP v8.1.2. Released v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n010.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 13:49:21 EDT 2023

% Result   : Unsatisfiable 0.20s 0.57s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   39 (  33 unt;   6 typ;   0 def)
%            Number of atoms       :   33 (  32 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  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

cnf(sos_006,axiom,
    add(unit,add(X1,mult(X1,X1))) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_006) ).

cnf(sos_004,axiom,
    add(zero,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_004) ).

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

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

cnf(sos_001,axiom,
    add(X1,X2) = add(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_001) ).

cnf(sos_005,axiom,
    mult(X1,unit) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_005) ).

cnf(sos_002,axiom,
    mult(X1,X2) = mult(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_002) ).

cnf(goals,negated_conjecture,
    add(x0,x1) != mult(x0,x1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(c_0_8,axiom,
    add(unit,add(X1,mult(X1,X1))) = X1,
    sos_006 ).

cnf(c_0_9,axiom,
    add(zero,X1) = X1,
    sos_004 ).

cnf(c_0_10,axiom,
    add(X1,add(X2,X3)) = add(add(X1,X2),X3),
    sos ).

cnf(c_0_11,plain,
    add(unit,mult(zero,zero)) = zero,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    add(unit,add(mult(zero,zero),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).

cnf(c_0_13,axiom,
    mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
    sos_003 ).

cnf(c_0_14,axiom,
    add(X1,X2) = add(X2,X1),
    sos_001 ).

cnf(c_0_15,plain,
    add(unit,mult(zero,X1)) = mult(zero,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).

cnf(c_0_16,axiom,
    mult(X1,unit) = X1,
    sos_005 ).

cnf(c_0_17,plain,
    add(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_18,plain,
    add(unit,add(X1,add(X2,mult(add(X1,X2),add(X1,X2))))) = add(X1,X2),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_19,plain,
    mult(zero,zero) = zero,
    inference(rw,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_20,plain,
    zero = unit,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,plain,
    add(unit,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_19]),c_0_9]),c_0_8]) ).

cnf(c_0_22,plain,
    add(X1,unit) = X1,
    inference(rw,[status(thm)],[c_0_17,c_0_20]) ).

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

cnf(c_0_24,plain,
    add(X1,mult(X1,X2)) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_14]),c_0_22]) ).

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

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

cnf(c_0_27,plain,
    add(X1,add(mult(X1,X1),X2)) = add(X1,X2),
    inference(spm,[status(thm)],[c_0_10,c_0_23]) ).

cnf(c_0_28,axiom,
    mult(X1,X2) = mult(X2,X1),
    sos_002 ).

cnf(c_0_29,plain,
    mult(X1,add(X1,X2)) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    add(x0,x1) != mult(x0,x1),
    goals ).

cnf(c_0_31,plain,
    mult(X1,X2) = add(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_25]),c_0_25]),c_0_28]),c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : RNG128-1 : TPTP v8.1.2. Released v5.4.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n010.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 01:49:35 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 0.20/0.57  % Version  : CSE_E---1.5
% 0.20/0.57  % Problem  : theBenchmark.p
% 0.20/0.57  % Proof found
% 0.20/0.57  % SZS status Theorem for theBenchmark.p
% 0.20/0.57  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.010000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.012000 s
%------------------------------------------------------------------------------