↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : KLE086+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 07:43:34 AM UTC 2026

% Result   : Theorem 7.54s 4.06s
% Output   : CNFRefutation 7.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            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 :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 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   :   16 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0) ).

fof(additive_identity,axiom,
    ! [X0] : addition(X0,zero) = X0 ).

fof(multiplicative_right_identity,axiom,
    ! [X0] : multiplication(X0,one) = X0 ).

fof(domain1,axiom,
    ! [X0] : multiplication(antidomain(X0),X0) = zero ).

fof(domain3,axiom,
    ! [X0] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one ).

fof(domain4,axiom,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)) ).

fof(goals,conjecture,
    domain(zero) = zero ).

fof(negated_conjecture,negated_conjecture,
    domain(zero) != zero,
    inference(negate_conjecture,[status(cth)],[goals]) ).

cnf(c0,plain,
    addition(X0,X1) = addition(X1,X0),
    inference(clausification,[status(esa)],[additive_commutativity]) ).

cnf(c2,plain,
    addition(X0,zero) = X0,
    inference(clausification,[status(esa)],[additive_identity]) ).

cnf(c5,plain,
    multiplication(X0,one) = X0,
    inference(clausification,[status(esa)],[multiplicative_right_identity]) ).

cnf(c13,plain,
    multiplication(antidomain(X0),X0) = zero,
    inference(clausification,[status(esa)],[domain1]) ).

cnf(c15,plain,
    addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
    inference(clausification,[status(esa)],[domain3]) ).

cnf(c16,plain,
    domain(X0) = antidomain(antidomain(X0)),
    inference(clausification,[status(esa)],[domain4]) ).

cnf(c21,plain,
    domain(zero) != zero,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    zero = antidomain(one),
    inference(superposition,[status(thm)],[c13,c5]) ).

cnf(d1,plain,
    addition(zero,X0) = X0,
    inference(superposition,[status(thm)],[c2,c0]) ).

cnf(d2,plain,
    addition(antidomain(X0),antidomain(antidomain(X0))) = one,
    inference(demodulation,[status(thm)],[c15,c0]) ).

cnf(d3,plain,
    antidomain(one) = zero,
    inference(superposition,[status(thm)],[c5,c13]) ).

cnf(d4,plain,
    addition(zero,antidomain(antidomain(one))) = one,
    inference(superposition,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    antidomain(antidomain(one)) = one,
    inference(demodulation,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    domain(one) = one,
    inference(demodulation,[status(thm)],[d5,c16]) ).

cnf(d7,plain,
    domain(one) = antidomain(zero),
    inference(superposition,[status(thm)],[d3,c16]) ).

cnf(d8,plain,
    one = antidomain(zero),
    inference(demodulation,[status(thm)],[d7,d6]) ).

cnf(d9,plain,
    domain(zero) = antidomain(one),
    inference(superposition,[status(thm)],[d8,c16]) ).

cnf(d10,plain,
    domain(zero) = zero,
    inference(demodulation,[status(thm)],[d9,d0]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[c21,d10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE086+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n018.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Fri Sep 25 19:22:35 UTC 2026
% 0.07/0.34  % CPUTime  : 
% 0.07/0.34  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.54/4.06  % SZS status Theorem for theBenchmark.p
% 7.54/4.06  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------