↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 22.05s 3.13s
% Output   : CNFRefutation 22.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (  24 unt;   0 def)
%            Number of atoms       :   65 (  43 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  23   ~;  21   |;   2   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   54 (   6 sgn  12   !;   1   ?)

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

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

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

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

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

fof(test_1,axiom,
    ! [X0] :
      ( test(X0)
    <=> ? [X1] : complement(X1,X0) ) ).

fof(test_2,axiom,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( addition(X0,X1) = one
        & multiplication(X1,X0) = zero
        & multiplication(X0,X1) = zero ) ) ).

fof(test_3,axiom,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ) ).

fof(goals,conjecture,
    c(one) = zero ).

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

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

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

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

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

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

cnf(c14,plain,
    ( ~ complement(X1,X0)
    | test(X0) ),
    inference(clausification,[status(esa)],[test_1]) ).

cnf(c16,plain,
    ( multiplication(X0,X1) = zero
    | ~ complement(X0,X1) ),
    inference(clausification,[status(esa)],[test_2]) ).

cnf(c18,plain,
    ( addition(X1,X0) != one
    | multiplication(X0,X1) != zero
    | multiplication(X1,X0) != zero
    | complement(X0,X1) ),
    inference(clausification,[status(esa)],[test_2]) ).

cnf(c19,plain,
    ( complement(X0,X1)
    | c(X0) != X1
    | ~ test(X0) ),
    inference(clausification,[status(esa)],[test_3]) ).

cnf(c22,plain,
    c(one) != zero,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( complement(X0,c(X0))
    | ~ test(X0) ),
    inference(equality_resolution,[status(thm)],[c19]) ).

cnf(d1,plain,
    ( multiplication(X0,c(X0)) = zero
    | ~ test(X0) ),
    inference(resolution,[status(thm)],[d0,c16]) ).

cnf(d2,plain,
    ( complement(zero,X0)
    | multiplication(zero,X0) != zero
    | addition(X0,zero) != one
    | zero != zero ),
    inference(superposition,[status(thm)],[c9,c18]) ).

cnf(d3,plain,
    ( complement(zero,X0)
    | multiplication(zero,X0) != zero
    | zero != zero
    | X0 != one ),
    inference(demodulation,[status(thm)],[d2,c2]) ).

cnf(d4,plain,
    ( complement(zero,X0)
    | zero != zero
    | zero != zero
    | X0 != one ),
    inference(demodulation,[status(thm)],[d3,c10]) ).

cnf(d5,plain,
    ( complement(zero,X0)
    | zero != zero
    | X0 != one ),
    inference(equality_resolution,[status(thm)],[d4]) ).

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

cnf(d7,plain,
    multiplication(X0,multiplication(X1,multiplication(X2,X3))) = multiplication(multiplication(X0,multiplication(X1,X2)),X3),
    inference(demodulation,[status(thm)],[d6,c4]) ).

cnf(d8,plain,
    multiplication(X0,multiplication(X1,multiplication(X2,X3))) = multiplication(X0,multiplication(multiplication(X1,X2),X3)),
    inference(demodulation,[status(thm)],[d7,c4]) ).

cnf(d9,plain,
    multiplication(X3,multiplication(X0,multiplication(X1,X2))) = multiplication(X3,multiplication(X0,multiplication(X1,X2))),
    inference(demodulation,[status(thm)],[d8,c4]) ).

cnf(d10,plain,
    zero = multiplication(zero,multiplication(X0,multiplication(X1,X2))),
    inference(superposition,[status(thm)],[c10,d9]) ).

cnf(d11,plain,
    zero = zero,
    inference(demodulation,[status(thm)],[d10,c10]) ).

cnf(d12,plain,
    ( complement(zero,X0)
    | X0 != one ),
    inference(resolution,[status(thm)],[d11,d5]) ).

cnf(d13,plain,
    complement(zero,one),
    inference(equality_resolution,[status(thm)],[d12]) ).

cnf(d14,plain,
    test(one),
    inference(resolution,[status(thm)],[d13,c14]) ).

cnf(d15,plain,
    multiplication(one,c(one)) = zero,
    inference(resolution,[status(thm)],[d14,d1]) ).

cnf(d16,plain,
    c(one) = zero,
    inference(demodulation,[status(thm)],[d15,c6]) ).

cnf(d17,plain,
    $false,
    inference(resolution,[status(thm)],[c22,d16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE005+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.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 19:12:00 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.05/3.13  % SZS status Theorem for theBenchmark.p
% 22.05/3.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------