↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n002.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:23 PM UTC 2026

% Result   : Theorem 13.14s 2.14s
% Output   : Proof 13.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  16 unt;   0 def)
%            Number of atoms       :   64 (  40 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   60 (  25   ~;  18   |;  12   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  28   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [A] : multiplication(one,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f6_nnf,plain,
    ! [A] : multiplication(one,A) = A,
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [A] : multiplication(one,A) = A,
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

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

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]) ).

fof(f18,conjecture,
    ! [X0,X1] :
      ( test(X1)
     => X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f18_neg,negated_conjecture,
    ~ ! [X0,X1] :
        ( test(X1)
       => X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [X0,X1] :
      ( X0 != addition(multiplication(X1,X0),multiplication(c(X1),X0))
      & test(X1) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ( sk1 != addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1))
    & test(sk2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2])],[f18_nnf]) ).

cnf(c24,plain,
    test(sk2),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(p99,plain,
    ( complement(sk2,X0)
    | c(sk2) != X0 ),
    inference(resolution,[status(thm)],[c19,c24]) ).

cnf(p100,plain,
    complement(sk2,c(sk2)),
    inference(equality_resolution,[status(thm)],[p99]) ).

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(c17,plain,
    ( addition(X0,X1) = one
    | ~ complement(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p104,plain,
    addition(sk2,c(sk2)) = one,
    inference(resolution,[status(thm)],[p100,c17]) ).

fof(f8,axiom,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).

fof(f8_nnf,plain,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(c25,plain,
    sk1 != addition(multiplication(sk2,sk1),multiplication(c(sk2),sk1)),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(p49,plain,
    sk1 != multiplication(addition(sk2,c(sk2)),sk1),
    inference(superposition,[status(thm)],[c8,c25]) ).

cnf(p105,plain,
    sk1 != multiplication(one,sk1),
    inference(demodulation,[status(thm)],[p104,p49]) ).

cnf(p108,plain,
    sk1 != sk1,
    inference(superposition,[status(thm)],[c6,p105]) ).

cnf(p111,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p108]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE021+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.38  % Computer : n002.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Wed Sep 23 18:41:36 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 13.14/2.14  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.14/2.14  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------