↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 30.54s 8.14s
% Output   : CNFRefutation 30.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  22 unt;   0 def)
%            Number of atoms       :   55 (  29 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  17   ~;  15   |;   0   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   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   :   58 (   5 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(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(infty_coinduction,axiom,
    ! [X0,X1,X2] :
      ( leq(X2,addition(multiplication(X0,X2),X1))
     => leq(X2,multiplication('strong$uiteration'(X0),X1)) ) ).

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

fof(goals,conjecture,
    ! [X0] : multiplication('strong$uiteration'(one),X0) = 'strong$uiteration'(one) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] : multiplication('strong$uiteration'(one),X0) = 'strong$uiteration'(one),
    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)],[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(c15,plain,
    ( leq(X0,multiplication('strong$uiteration'(X1),X2))
    | ~ leq(X0,addition(multiplication(X1,X0),X2)) ),
    inference(clausification,[status(esa)],[infty_coinduction]) ).

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,
    multiplication('strong$uiteration'(one),sK34) != 'strong$uiteration'(one),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( leq(X0,multiplication('strong$uiteration'(one),X1))
    | ~ leq(X0,addition(X0,X1)) ),
    inference(superposition,[status(thm)],[c6,c15]) ).

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

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

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

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

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

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

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

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

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

cnf(d10,plain,
    X0 = X0,
    inference(resolution,[status(thm)],[d9,d7]) ).

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

cnf(d12,plain,
    leq(X0,multiplication('strong$uiteration'(one),X1)),
    inference(resolution,[status(thm)],[d11,d0]) ).

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

cnf(d14,plain,
    ( ~ leq(X1,X0)
    | ~ leq(X0,X1)
    | X0 = X1 ),
    inference(superposition,[status(thm)],[d13,c17]) ).

cnf(d15,plain,
    ( ~ leq(X0,addition(X0,one))
    | leq(X0,'strong$uiteration'(one)) ),
    inference(superposition,[status(thm)],[c5,d0]) ).

cnf(d16,plain,
    leq(X0,'strong$uiteration'(one)),
    inference(resolution,[status(thm)],[d11,d15]) ).

cnf(d17,plain,
    ( ~ leq('strong$uiteration'(one),X0)
    | X0 = 'strong$uiteration'(one) ),
    inference(resolution,[status(thm)],[d16,d14]) ).

cnf(d18,plain,
    multiplication('strong$uiteration'(one),X0) = 'strong$uiteration'(one),
    inference(resolution,[status(thm)],[d17,d12]) ).

cnf(d19,plain,
    $false,
    inference(resolution,[status(thm)],[d18,c19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KLE141+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n005.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Fri Sep 25 19:26:17 UTC 2026
% 0.18/0.43  % CPUTime  : 
% 0.18/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.54/8.14  % SZS status Theorem for theBenchmark.p
% 30.54/8.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------