↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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:40 AM UTC 2026

% Result   : Theorem 50.26s 6.79s
% Output   : CNFRefutation 50.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   55 (  42 unt;   0 def)
%            Number of atoms       :   70 (  47 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  14   ~;  10   |;   2   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   81 (   8 sgn  22   !;   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(idempotence,axiom,
    ! [X0] : addition(X0,X0) = X0 ).

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

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

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

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

fof(infty_unfold1,axiom,
    ! [X0] : 'strong$uiteration'(X0) = addition(multiplication(X0,'strong$uiteration'(X0)),one) ).

fof(order,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ) ).

fof(goals,conjecture,
    ! [X0,X1] :
      ( leq(X0,multiplication(X0,'strong$uiteration'(X1)))
      & ( multiplication(X0,X1) = zero
       => leq(multiplication(X0,'strong$uiteration'(X1)),X0) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( leq(X0,multiplication(X0,'strong$uiteration'(X1)))
        & ( multiplication(X0,X1) = zero
         => leq(multiplication(X0,'strong$uiteration'(X1)),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)],[idempotence]) ).

cnf(c4,plain,
    multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(clausification,[status(esa)],[multiplicative_associativity]) ).

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

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

cnf(c9,plain,
    multiplication(zero,X0) = zero,
    inference(clausification,[status(esa)],[left_annihilation]) ).

cnf(c14,plain,
    'strong$uiteration'(X0) = addition(multiplication(X0,'strong$uiteration'(X0)),one),
    inference(clausification,[status(esa)],[infty_unfold1]) ).

cnf(c17,plain,
    ( addition(X0,X1) = X1
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[order]) ).

cnf(c18,plain,
    ( addition(X0,X1) != X1
    | leq(X0,X1) ),
    inference(clausification,[status(esa)],[order]) ).

cnf(c19,plain,
    ( ~ leq(sK34,multiplication(sK34,'strong$uiteration'(sK35)))
    | multiplication(sK34,sK35) = zero ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c20,plain,
    ( ~ leq(sK34,multiplication(sK34,'strong$uiteration'(sK35)))
    | ~ leq(multiplication(sK34,'strong$uiteration'(sK35)),sK34) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

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

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

cnf(d3,plain,
    multiplication(X1,X0) = multiplication(X1,X0),
    inference(demodulation,[status(thm)],[d2,c5]) ).

cnf(d4,plain,
    multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
    inference(superposition,[status(thm)],[c4,d3]) ).

cnf(d5,plain,
    addition(X0,addition(X0,X1)) = addition(X0,X1),
    inference(superposition,[status(thm)],[c3,c1]) ).

cnf(d6,plain,
    ( leq(X0,addition(X0,X1))
    | addition(X0,X1) != addition(X0,X1) ),
    inference(superposition,[status(thm)],[d5,c18]) ).

cnf(d7,plain,
    ( ~ leq(X0,X1)
    | addition(X1,X0) = X1 ),
    inference(superposition,[status(thm)],[c17,c0]) ).

cnf(d8,plain,
    ( ~ leq(addition(X0,X1),X0)
    | addition(X0,X1) = X0 ),
    inference(superposition,[status(thm)],[d5,d7]) ).

cnf(d9,plain,
    X0 = addition(X0,X0),
    inference(superposition,[status(thm)],[c3,c0]) ).

cnf(d10,plain,
    ( addition(X0,X0) = X0
    | ~ leq(X0,X0) ),
    inference(superposition,[status(thm)],[d9,d8]) ).

cnf(d11,plain,
    ( ~ leq(X0,X0)
    | X0 = X0 ),
    inference(demodulation,[status(thm)],[d10,c3]) ).

cnf(d12,plain,
    ( leq(X0,X0)
    | X0 != X0 ),
    inference(superposition,[status(thm)],[c3,c18]) ).

cnf(d13,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[d12]) ).

cnf(d14,plain,
    X0 = X0,
    inference(resolution,[status(thm)],[d13,d11]) ).

cnf(d15,plain,
    leq(X0,addition(X0,X1)),
    inference(resolution,[status(thm)],[d14,d6]) ).

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

cnf(d17,plain,
    leq(X0,multiplication(X0,addition(one,X1))),
    inference(superposition,[status(thm)],[d16,d15]) ).

cnf(d18,plain,
    'strong$uiteration'(X0) = addition(one,multiplication(X0,'strong$uiteration'(X0))),
    inference(demodulation,[status(thm)],[c14,c0]) ).

cnf(d19,plain,
    leq(X1,multiplication(X1,'strong$uiteration'(X0))),
    inference(superposition,[status(thm)],[d18,d17]) ).

cnf(d20,plain,
    multiplication(sK34,sK35) = zero,
    inference(resolution,[status(thm)],[d19,c19]) ).

cnf(d21,plain,
    multiplication(zero,X0) = multiplication(sK34,multiplication(sK35,X0)),
    inference(superposition,[status(thm)],[d20,d4]) ).

cnf(d22,plain,
    zero = multiplication(sK34,multiplication(sK35,X0)),
    inference(demodulation,[status(thm)],[d21,c9]) ).

cnf(d23,plain,
    multiplication(sK34,addition(multiplication(sK35,X0),one)) = addition(sK34,zero),
    inference(superposition,[status(thm)],[d22,d1]) ).

cnf(d24,plain,
    multiplication(sK34,addition(one,multiplication(sK35,X0))) = addition(sK34,zero),
    inference(demodulation,[status(thm)],[d23,c0]) ).

cnf(d25,plain,
    multiplication(sK34,addition(one,multiplication(sK35,X0))) = sK34,
    inference(demodulation,[status(thm)],[d24,c2]) ).

cnf(d26,plain,
    multiplication(sK34,'strong$uiteration'(sK35)) = sK34,
    inference(superposition,[status(thm)],[d18,d25]) ).

cnf(d27,plain,
    ~ leq(multiplication(sK34,'strong$uiteration'(sK35)),sK34),
    inference(resolution,[status(thm)],[d19,c20]) ).

cnf(d28,plain,
    ~ leq(sK34,sK34),
    inference(demodulation,[status(thm)],[d27,d26]) ).

cnf(d29,plain,
    $false,
    inference(resolution,[status(thm)],[d13,d28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE148+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 19:30:05 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.26/6.79  % SZS status Theorem for theBenchmark.p
% 50.26/6.79  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------