↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KLE086+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 : n031.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:41 PM UTC 2026

% Result   : Theorem 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (  27 unt;   0 def)
%            Number of atoms       :   27 (  26 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(domain3,axiom,
    ! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain3) ).

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

fof(domain1,axiom,
    ! [X4] : multiplication(antidomain(X4),X4) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).

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

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

fof(goals,conjecture,
    domain(zero) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(domain4,axiom,
    ! [X4] : domain(X4) = antidomain(antidomain(X4)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).

fof(c_0_7,plain,
    ! [X63] : addition(antidomain(antidomain(X63)),antidomain(X63)) = one,
    inference(variable_rename,[status(thm)],[domain3]) ).

fof(c_0_8,plain,
    ! [X38,X39] : addition(X38,X39) = addition(X39,X38),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

fof(c_0_9,plain,
    ! [X60] : multiplication(antidomain(X60),X60) = zero,
    inference(variable_rename,[status(thm)],[domain1]) ).

fof(c_0_10,plain,
    ! [X48] : multiplication(X48,one) = X48,
    inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).

fof(c_0_11,plain,
    ! [X43] : addition(X43,zero) = X43,
    inference(variable_rename,[status(thm)],[additive_identity]) ).

fof(c_0_12,negated_conjecture,
    domain(zero) != zero,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).

fof(c_0_13,plain,
    ! [X64] : domain(X64) = antidomain(antidomain(X64)),
    inference(variable_rename,[status(thm)],[domain4]) ).

cnf(c_0_14,plain,
    addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_16,plain,
    multiplication(antidomain(X1),X1) = zero,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_18,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    domain(zero) != zero,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    domain(X1) = antidomain(antidomain(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,plain,
    addition(antidomain(X1),antidomain(antidomain(X1))) = one,
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_22,plain,
    antidomain(one) = zero,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    antidomain(antidomain(zero)) != zero,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    antidomain(zero) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : KLE086+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 : n031.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:32:53 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.34  % 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.371s
%------------------------------------------------------------------------------