↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : KLE038+1 : 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 : n008.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:29 AM UTC 2026

% Result   : Theorem 28.29s 7.48s
% Output   : CNFRefutation 28.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   46 (  29 unt;   0 def)
%            Number of atoms       :   64 (  28 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   37 (  19   ~;  17   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   85 (   9 sgn  15   !;   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_idempotence,axiom,
    ! [X0] : addition(X0,X0) = X0 ).

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

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

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

fof(star_unfold_right,axiom,
    ! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)) ).

fof(goals,conjecture,
    ! [X0] : leq(X0,star(X0)) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] : leq(X0,star(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(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(c7,plain,
    multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(clausification,[status(esa)],[right_distributivity]) ).

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

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

cnf(c13,plain,
    leq(addition(one,multiplication(X0,star(X0))),star(X0)),
    inference(clausification,[status(esa)],[star_unfold_right]) ).

cnf(c17,plain,
    ~ leq(sK30,star(sK30)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d1,plain,
    ( leq(X0,addition(X0,X1))
    | addition(X0,X1) != addition(X0,X1) ),
    inference(superposition,[status(thm)],[d0,c12]) ).

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

cnf(d3,plain,
    ( ~ leq(addition(X0,X1),X0)
    | addition(X0,X1) = X0 ),
    inference(superposition,[status(thm)],[d0,d2]) ).

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

cnf(d5,plain,
    ( addition(X0,X0) = X0
    | ~ leq(X0,X0) ),
    inference(superposition,[status(thm)],[d4,d3]) ).

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

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

cnf(d8,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[d7]) ).

cnf(d9,plain,
    X0 = X0,
    inference(resolution,[status(thm)],[d8,d6]) ).

cnf(d10,plain,
    leq(X0,addition(X0,X1)),
    inference(resolution,[status(thm)],[d9,d1]) ).

cnf(d11,plain,
    addition(X2,addition(X0,X1)) = addition(X0,addition(X1,X2)),
    inference(superposition,[status(thm)],[c1,c0]) ).

cnf(d12,plain,
    addition(X2,addition(X1,X0)) = addition(X0,addition(X1,X2)),
    inference(superposition,[status(thm)],[c0,d11]) ).

cnf(d13,plain,
    leq(X0,addition(X2,addition(X1,X0))),
    inference(superposition,[status(thm)],[d12,d10]) ).

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

cnf(d15,plain,
    ( ~ leq(addition(X1,X2),X0)
    | leq(X2,X0) ),
    inference(superposition,[status(thm)],[d14,d13]) ).

cnf(d16,plain,
    leq(multiplication(X0,star(X0)),star(X0)),
    inference(resolution,[status(thm)],[d15,c13]) ).

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

cnf(d18,plain,
    ( ~ leq(addition(X0,X1),X2)
    | X2 = addition(X0,addition(X1,X2)) ),
    inference(superposition,[status(thm)],[c1,d17]) ).

cnf(d19,plain,
    ( ~ leq(addition(X0,X1),X2)
    | leq(X0,X2) ),
    inference(superposition,[status(thm)],[d18,d10]) ).

cnf(d20,plain,
    ( ~ leq(X0,X1)
    | leq(X0,X2)
    | ~ leq(X1,X2) ),
    inference(superposition,[status(thm)],[c11,d19]) ).

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

cnf(d22,plain,
    leq(X0,multiplication(X0,addition(one,X1))),
    inference(superposition,[status(thm)],[d21,d10]) ).

cnf(d23,plain,
    ( ~ leq(addition(one,X0),X1)
    | leq(X2,multiplication(X2,X1)) ),
    inference(superposition,[status(thm)],[d18,d22]) ).

cnf(d24,plain,
    leq(X0,multiplication(X0,star(X1))),
    inference(resolution,[status(thm)],[d23,c13]) ).

cnf(d25,plain,
    ( leq(X0,X2)
    | ~ leq(multiplication(X0,star(X1)),X2) ),
    inference(resolution,[status(thm)],[d24,d20]) ).

cnf(d26,plain,
    leq(X0,star(X0)),
    inference(resolution,[status(thm)],[d25,d16]) ).

cnf(d27,plain,
    $false,
    inference(resolution,[status(thm)],[d26,c17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE038+1 : 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 : n008.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:17:24 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.29/7.48  % SZS status Theorem for theBenchmark.p
% 28.29/7.48  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------