↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KLE005+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n010.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 : Fri Sep 25 01:51:18 PM UTC 2026

% Result   : Theorem 32.10s 4.51s
% Output   : Proof 32.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :   58 (  34 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   59 (  24   ~;  21   |;  10   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   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   :   21 (   0 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).

fof(f14_nnf,plain,
    ! [X0,X1] :
      ( ( ( ~ complement(X0,X1)
          | c(X0) = X1 )
        & ( complement(X0,X1)
          | c(X0) != X1 ) )
      | ~ test(X0) ),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [X0,X1] :
      ( ( ( ~ complement(X0,X1)
          | c(X0) = X1 )
        & ( complement(X0,X1)
          | c(X0) != X1 ) )
      | ~ test(X0) ),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

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

fof(f15,axiom,
    ! [X0] :
      ( ~ test(X0)
     => c(X0) = zero ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_4) ).

fof(f15_nnf,plain,
    ! [X0] :
      ( c(X0) = zero
      | test(X0) ),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [X0] :
      ( c(X0) = zero
      | test(X0) ),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c21,plain,
    ( c(X0) = zero
    | test(X0) ),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

fof(f16,conjecture,
    c(one) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

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

fof(f16_nnf,plain,
    c(one) != zero,
    inference(nnf_transformation,[status(thm)],[f16_neg]) ).

fof(f16_sk,plain,
    c(one) != zero,
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

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

cnf(p25,plain,
    test(one),
    inference(resolution,[status(thm)],[c21,c22]) ).

cnf(p63,plain,
    ( complement(one,X0)
    | c(one) != X0 ),
    inference(resolution,[status(thm)],[c19,p25]) ).

cnf(p64,plain,
    complement(one,c(one)),
    inference(equality_resolution,[status(thm)],[p63]) ).

fof(f13,axiom,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( addition(X0,X1) = one
        & multiplication(X1,X0) = zero
        & multiplication(X0,X1) = zero ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).

fof(f13_nnf,plain,
    ! [X0,X1] :
      ( ( addition(X0,X1) != one
        | multiplication(X1,X0) != zero
        | multiplication(X0,X1) != zero
        | complement(X1,X0) )
      & ( ( addition(X0,X1) = one
          & multiplication(X1,X0) = zero
          & multiplication(X0,X1) = zero )
        | ~ complement(X1,X0) ) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [X1,X0] :
      ( ( addition(X0,X1) != one
        | multiplication(X1,X0) != zero
        | multiplication(X0,X1) != zero
        | complement(X1,X0) )
      & ( ( addition(X0,X1) = one
          & multiplication(X1,X0) = zero
          & multiplication(X0,X1) = zero )
        | ~ complement(X1,X0) ) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c15,plain,
    ( multiplication(X0,X1) = zero
    | ~ complement(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p66,plain,
    c(one) = zero,
    inference(resolution,[status(thm)],[p64,c15]) ).

cnf(p67,plain,
    zero != zero,
    inference(demodulation,[status(thm)],[p66,c22]) ).

cnf(p73,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE005+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n010.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 : Wed Sep 23 18:34:28 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 32.10/4.51  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.10/4.51  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------