↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KLE075+1 : 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 : n004.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:39 PM UTC 2026

% Result   : Theorem 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            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   :   12 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4] : domain(multiplication(one,domain(X4))) = domain(X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X4] : domain(multiplication(one,domain(X4))) = domain(X4),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_4,negated_conjecture,
    domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

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

fof(c_0_6,plain,
    ! [X58,X59] : domain(multiplication(X58,X59)) = domain(multiplication(X58,domain(X59))),
    inference(variable_rename,[status(thm)],[domain2]) ).

cnf(c_0_7,negated_conjecture,
    domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    domain(domain(esk1_0)) != domain(esk1_0),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : KLE075+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % 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.14/0.32  % Computer : n004.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Mon May  4 20:28:02 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Theorem for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.368s
%------------------------------------------------------------------------------