↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : KLE055+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 : n026.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:31 AM UTC 2026

% Result   : Theorem 31.24s 9.81s
% Output   : CNFRefutation 31.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   47 (  45 unt;   0 def)
%            Number of atoms       :   49 (  48 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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;   3 con; 0-2 aty)
%            Number of variables   :   65 (   5 sgn  19   !;   0   ?)

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

fof(additive_associativity,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0) ).

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

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

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

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

fof(right_distributivity,axiom,
    ! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)) ).

fof(left_distributivity,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)) ).

fof(domain1,axiom,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0) ).

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

fof(goals,conjecture,
    ! [X0] :
      ( addition(X0,one) = one
     => addition(X0,domain(X0)) = domain(X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( addition(X0,one) = one
       => addition(X0,domain(X0)) = domain(X0) ),
    inference(negate_conjecture,[status(cth)],[goals]) ).

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

cnf(c1,plain,
    addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
    inference(clausification,[status(esa)],[additive_associativity]) ).

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

cnf(c3,plain,
    addition(X0,X0) = X0,
    inference(clausification,[status(esa)],[additive_idempotence]) ).

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

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

cnf(c7,plain,
    multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(clausification,[status(esa)],[right_distributivity]) ).

cnf(c8,plain,
    multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(clausification,[status(esa)],[left_distributivity]) ).

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

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

cnf(c18,plain,
    addition(sK28,one) = one,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c19,plain,
    addition(sK28,domain(sK28)) != domain(sK28),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    addition(X0,addition(X1,zero)) = addition(X0,X1),
    inference(superposition,[status(thm)],[c1,c2]) ).

cnf(d1,plain,
    addition(X1,X0) = addition(X1,X0),
    inference(demodulation,[status(thm)],[d0,c2]) ).

cnf(d2,plain,
    multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
    inference(superposition,[status(thm)],[c5,c7]) ).

cnf(d3,plain,
    addition(one,sK28) = one,
    inference(demodulation,[status(thm)],[c18,c0]) ).

cnf(d4,plain,
    multiplication(X0,one) = addition(X0,multiplication(X0,sK28)),
    inference(superposition,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    X0 = addition(X0,multiplication(X0,sK28)),
    inference(demodulation,[status(thm)],[d4,c5]) ).

cnf(d6,plain,
    addition(X0,multiplication(X0,sK28)) = X0,
    inference(superposition,[status(thm)],[d5,d1]) ).

cnf(d7,plain,
    multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
    inference(superposition,[status(thm)],[c6,c8]) ).

cnf(d8,plain,
    addition(one,addition(sK28,X0)) = addition(one,X0),
    inference(superposition,[status(thm)],[d3,c1]) ).

cnf(d9,plain,
    addition(one,addition(addition(sK28,X0),X1)) = addition(addition(one,X0),X1),
    inference(superposition,[status(thm)],[d8,c1]) ).

cnf(d10,plain,
    addition(one,addition(sK28,addition(X0,X1))) = addition(addition(one,X0),X1),
    inference(demodulation,[status(thm)],[d9,c1]) ).

cnf(d11,plain,
    addition(one,addition(X0,X1)) = addition(addition(one,X0),X1),
    inference(demodulation,[status(thm)],[d10,d8]) ).

cnf(d12,plain,
    addition(one,addition(X0,X1)) = addition(one,addition(X0,X1)),
    inference(demodulation,[status(thm)],[d11,c1]) ).

cnf(d13,plain,
    addition(one,X0) = addition(one,addition(X0,X0)),
    inference(superposition,[status(thm)],[c3,d12]) ).

cnf(d14,plain,
    addition(one,X0) = addition(one,X0),
    inference(demodulation,[status(thm)],[d13,c3]) ).

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

cnf(d16,plain,
    one = addition(one,domain(X0)),
    inference(superposition,[status(thm)],[d15,d14]) ).

cnf(d17,plain,
    multiplication(one,X1) = addition(X1,multiplication(domain(X0),X1)),
    inference(superposition,[status(thm)],[d16,d7]) ).

cnf(d18,plain,
    X0 = addition(X0,multiplication(domain(X1),X0)),
    inference(demodulation,[status(thm)],[d17,c6]) ).

cnf(d19,plain,
    X0 = multiplication(domain(X0),X0),
    inference(demodulation,[status(thm)],[c13,d18]) ).

cnf(d20,plain,
    addition(domain(sK28),sK28) = domain(sK28),
    inference(superposition,[status(thm)],[d19,d6]) ).

cnf(d21,plain,
    addition(sK28,domain(sK28)) = domain(sK28),
    inference(demodulation,[status(thm)],[d20,c0]) ).

cnf(d22,plain,
    $false,
    inference(resolution,[status(thm)],[c19,d21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE055+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.11/5.38  % Computer : n026.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Fri Sep 25 19:21:31 UTC 2026
% 0.11/5.39  % CPUTime  : 
% 0.11/5.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.24/9.81  % SZS status Theorem for theBenchmark.p
% 31.24/9.81  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------