↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM305+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% 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 : Tue May  5 04:53:07 PM UTC 2026

% Result   : Theorem 214.52s 59.44s
% Output   : CNFRefutation 214.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   24 (  15 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   44 (  20   ~;  18   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   41 (   0 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sum_entry_point_pos_pos,axiom,
    ! [X1,X2,X3,X10,X11,X12] :
      ( ( rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X2,rdn_pos(X11))
        & rdn_add_with_carry(rdnn(n0),X10,X11,X12)
        & rdn_translate(X3,rdn_pos(X12)) )
     => sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).

fof(add_digit_digit_digit,axiom,
    ! [X21,X22,X23,X24,X25] :
      ( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
        & rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0)) )
     => rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).

fof(rdn5,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn5) ).

fof(rdn_digit_add_n5_n0_n5_n0,axiom,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_n0) ).

fof(rdn3,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).

fof(rdn_digit_add_n2_n3_n5_n0,axiom,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0) ).

fof(sum_n2_n3_n5,conjecture,
    sum(n2,n3,n5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_n3_n5) ).

fof(rdn2,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).

fof(c_0_8,plain,
    ! [X189,X190,X191,X192,X193,X194] :
      ( ~ rdn_translate(X189,rdn_pos(X192))
      | ~ rdn_translate(X190,rdn_pos(X193))
      | ~ rdn_add_with_carry(rdnn(n0),X192,X193,X194)
      | ~ rdn_translate(X191,rdn_pos(X194))
      | sum(X189,X190,X191) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])]) ).

fof(c_0_9,plain,
    ! [X236,X237,X238,X239,X240] :
      ( ~ rdn_digit_add(rdnn(X237),rdnn(X238),rdnn(X240),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X240),rdnn(X236),rdnn(X239),rdnn(n0))
      | rdn_add_with_carry(rdnn(X236),rdnn(X237),rdnn(X238),rdnn(X239)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])]) ).

cnf(c_0_10,plain,
    ( sum(X1,X3,X6)
    | ~ rdn_translate(X1,rdn_pos(X2))
    | ~ rdn_translate(X3,rdn_pos(X4))
    | ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
    | ~ rdn_translate(X6,rdn_pos(X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[rdn5]) ).

cnf(c_0_12,plain,
    ( rdn_add_with_carry(rdnn(X4),rdnn(X1),rdnn(X2),rdnn(X5))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0))
    | ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X5),rdnn(n0)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).

cnf(c_0_14,plain,
    ( sum(X1,X2,n5)
    | ~ rdn_add_with_carry(rdnn(n0),X3,X4,rdnn(n5))
    | ~ rdn_translate(X2,rdn_pos(X4))
    | ~ rdn_translate(X1,rdn_pos(X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(split_conjunct,[status(thm)],[rdn3]) ).

cnf(c_0_16,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n3_n5_n0]) ).

fof(c_0_18,negated_conjecture,
    ~ sum(n2,n3,n5),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[sum_n2_n3_n5])]) ).

cnf(c_0_19,plain,
    ( sum(X1,n3,n5)
    | ~ rdn_add_with_carry(rdnn(n0),X2,rdnn(n3),rdnn(n5))
    | ~ rdn_translate(X1,rdn_pos(X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(split_conjunct,[status(thm)],[rdn2]) ).

cnf(c_0_21,plain,
    rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ~ sum(n2,n3,n5),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM305+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34  % Computer : n011.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Tue May  5 00:25:17 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 214.52/59.44  % Version  : CSE_E---1.7
% 214.52/59.44  % Problem  : theBenchmark.p
% 214.52/59.44  % SZS status Theorem for theBenchmark.p
% 214.52/59.44  % SZS output start CNFRefutation
% See solution above
% 214.52/59.48  % Total time : 57.662s
%------------------------------------------------------------------------------