↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n001.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 30.41s 4.27s
% Output   : Proof 30.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (  19 unt;   0 def)
%            Number of atoms       :   82 (  41 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   81 (  35   ~;  30   |;  12   &)
%                                         (   3 <=>;   1  =>;   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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   2 sgn  20   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f13,axiom,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( addition(X0,X1) = one
        & multiplication(X1,X0) = zero
        & multiplication(X0,X1) = zero ) ),
    file('/export/starexec/sandbox/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(c18,plain,
    ( addition(X0,X1) != one
    | multiplication(X1,X0) != zero
    | multiplication(X0,X1) != zero
    | complement(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

fof(f9,axiom,
    ! [A] : multiplication(A,zero) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).

fof(f9_nnf,plain,
    ! [A] : multiplication(A,zero) = zero,
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [A] : multiplication(A,zero) = zero,
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

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

cnf(p67,plain,
    ( X0 != one
    | zero != zero
    | complement(zero,X0) ),
    inference(resolution,[status(thm)],[c18,c9]) ).

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

cnf(p992,plain,
    complement(zero,one),
    inference(equality_resolution,[status(thm)],[p988]) ).

fof(f12,axiom,
    ! [X0] :
      ( test(X0)
    <=> ? [X1] : complement(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_1) ).

fof(f12_nnf,plain,
    ! [X0] :
      ( ( ! [X1] : ~ complement(X1,X0)
        | test(X0) )
      & ( ? [X1] : complement(X1,X0)
        | ~ test(X0) ) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X0,X1] :
      ( ( ~ complement(X1,X0)
        | test(X0) )
      & ( complement(sk0(X0),X0)
        | ~ test(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f12_nnf]) ).

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

cnf(p993,plain,
    test(one),
    inference(resolution,[status(thm)],[p992,c14]) ).

fof(f14,axiom,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    file('/export/starexec/sandbox/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]) ).

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

cnf(p996,plain,
    complement(one,c(one)),
    inference(resolution,[status(thm)],[p993,p74]) ).

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

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

cnf(p1008,plain,
    test(c(one)),
    inference(resolution,[status(thm)],[p996,c14]) ).

cnf(p1013,plain,
    test(zero),
    inference(demodulation,[status(thm)],[p1009,p1008]) ).

cnf(p1016,plain,
    complement(zero,c(zero)),
    inference(resolution,[status(thm)],[p1013,p74]) ).

cnf(c17,plain,
    ( addition(X0,X1) = one
    | ~ complement(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p1028,plain,
    c(zero) = one,
    inference(resolution,[status(thm)],[p1016,c17]) ).

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

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

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

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

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

cnf(p1029,plain,
    one != one,
    inference(demodulation,[status(thm)],[p1028,c22]) ).

cnf(p1032,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p1029]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE004+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.34  % Computer : n001.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Wed Sep 23 18:40:05 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 30.41/4.27  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.41/4.27  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------