↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KLE021+3 : TPTP v9.2.1. Released v4.0.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 : n024.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:35:30 PM UTC 2026

% Result   : Theorem 1.14s 1.62s
% Output   : CNFRefutation 1.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  15 unt;   0 def)
%            Number of atoms       :   51 (  29 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   43 (  17   ~;  14   |;   7   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(test_3,axiom,
    ! [X4,X5] :
      ( test(X4)
     => ( c(X4) = X5
      <=> complement(X4,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).

fof(goals,conjecture,
    ! [X4,X5] :
      ( test(X5)
     => X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(test_2,axiom,
    ! [X4,X5] :
      ( complement(X5,X4)
    <=> ( multiplication(X4,X5) = zero
        & multiplication(X5,X4) = zero
        & addition(X4,X5) = one ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(left_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

fof(c_0_6,plain,
    ! [X69,X70] :
      ( ( c(X69) != X70
        | complement(X69,X70)
        | ~ test(X69) )
      & ( ~ complement(X69,X70)
        | c(X69) = X70
        | ~ test(X69) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X4,X5] :
        ( test(X5)
       => X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_8,plain,
    ( complement(X1,X2)
    | c(X1) != X2
    | ~ test(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,negated_conjecture,
    ( test(esk3_0)
    & esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_10,plain,
    ! [X67,X68] :
      ( ( multiplication(X67,X68) = zero
        | ~ complement(X68,X67) )
      & ( multiplication(X68,X67) = zero
        | ~ complement(X68,X67) )
      & ( addition(X67,X68) = one
        | ~ complement(X68,X67) )
      & ( multiplication(X67,X68) != zero
        | multiplication(X68,X67) != zero
        | addition(X67,X68) != one
        | complement(X68,X67) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).

cnf(c_0_11,plain,
    ( complement(X1,c(X1))
    | ~ test(X1) ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    test(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X41,X42] : addition(X41,X42) = addition(X42,X41),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

fof(c_0_14,plain,
    ! [X56,X57,X58] : multiplication(addition(X56,X57),X58) = addition(multiplication(X56,X58),multiplication(X57,X58)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

cnf(c_0_15,plain,
    ( addition(X1,X2) = one
    | ~ complement(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    complement(esk3_0,c(esk3_0)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X52] : multiplication(one,X52) = X52,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_0_19,plain,
    multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    addition(esk3_0,c(esk3_0)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,negated_conjecture,
    addition(multiplication(esk3_0,X1),multiplication(c(esk3_0),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : KLE021+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 15:25:56 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.14/1.62  % Version  : CSE_E---1.7
% 1.14/1.62  % Problem  : theBenchmark.p
% 1.14/1.62  % SZS status Theorem for theBenchmark.p
% 1.14/1.62  % SZS output start CNFRefutation
% See solution above
% 1.14/1.62  % Total time : 1.361s
%------------------------------------------------------------------------------