↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KLE007+2 : 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:19 PM UTC 2026

% Result   : Theorem 34.72s 5.05s
% Output   : Proof 34.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  19 unt;   0 def)
%            Number of atoms       :   95 (  43 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   92 (  37   ~;  29   |;  20   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn  40   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,axiom,
    ! [A,B] : addition(A,B) = addition(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f0_nnf,plain,
    ! [A,B] : addition(A,B) = addition(B,A),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B] : addition(A,B) = addition(B,A),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[status(esa)],[f0_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(f16,conjecture,
    ! [X0,X1] :
      ( ( test(X0)
        & test(X1) )
     => ( leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
        & leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f16_neg,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( test(X0)
          & test(X1) )
       => ( leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
          & leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) ) ),
    inference(negated_conjecture,[status(cth)],[f16]) ).

fof(f16_nnf,plain,
    ? [X0,X1] :
      ( ( ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
        | ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) )
      & test(X0)
      & test(X1) ),
    inference(nnf_transformation,[status(thm)],[f16_neg]) ).

fof(f16_sk,plain,
    ( ( ~ leq(addition(multiplication(addition(sk1,c(sk1)),sk2),multiplication(addition(sk1,c(sk1)),c(sk2))),one)
      | ~ leq(one,addition(multiplication(addition(sk1,c(sk1)),sk2),multiplication(addition(sk1,c(sk1)),c(sk2)))) )
    & test(sk1)
    & test(sk2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2])],[f16_nnf]) ).

cnf(c23,plain,
    test(sk1),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(p112,plain,
    ( complement(sk1,X0)
    | c(sk1) != X0 ),
    inference(resolution,[status(thm)],[c19,c23]) ).

cnf(p136,plain,
    complement(sk1,c(sk1)),
    inference(equality_resolution,[status(thm)],[p112]) ).

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(p143,plain,
    addition(sk1,c(sk1)) = one,
    inference(resolution,[status(thm)],[p136,c17]) ).

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

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

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

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

cnf(p41,plain,
    addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X2,X1)),
    inference(superposition,[status(thm)],[c7,c0]) ).

cnf(c24,plain,
    ( ~ leq(addition(multiplication(addition(sk1,c(sk1)),sk2),multiplication(addition(sk1,c(sk1)),c(sk2))),one)
    | ~ leq(one,addition(multiplication(addition(sk1,c(sk1)),sk2),multiplication(addition(sk1,c(sk1)),c(sk2)))) ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(p43,plain,
    ( ~ leq(multiplication(addition(sk1,c(sk1)),addition(c(sk2),sk2)),one)
    | ~ leq(one,multiplication(addition(sk1,c(sk1)),addition(c(sk2),sk2))) ),
    inference(demodulation,[status(thm)],[p41,c24]) ).

cnf(p144,plain,
    ( ~ leq(multiplication(one,addition(c(sk2),sk2)),one)
    | ~ leq(one,multiplication(one,addition(c(sk2),sk2))) ),
    inference(demodulation,[status(thm)],[p143,p43]) ).

cnf(p928,plain,
    ( ~ leq(one,one)
    | ~ leq(one,one) ),
    inference(superposition,[status(thm)],[c0,p144]) ).

cnf(p932,plain,
    ~ leq(one,one),
    inference(factoring,[status(thm)],[p928]) ).

fof(f11,axiom,
    ! [A,B] :
      ( leq(A,B)
    <=> addition(A,B) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).

fof(f11_nnf,plain,
    ! [A,B] :
      ( ( addition(A,B) != B
        | leq(A,B) )
      & ( addition(A,B) = B
        | ~ leq(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [A,B] :
      ( ( addition(A,B) != B
        | leq(A,B) )
      & ( addition(A,B) = B
        | ~ leq(A,B) ) ),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c12,plain,
    ( addition(X0,X1) != X1
    | leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

fof(f3,axiom,
    ! [A] : addition(A,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).

fof(f3_nnf,plain,
    ! [A] : addition(A,A) = A,
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A] : addition(A,A) = A,
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    addition(X0,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p52,plain,
    leq(X0,X0),
    inference(resolution,[status(thm)],[c12,c3]) ).

cnf(p933,plain,
    $false,
    inference(resolution,[status(thm)],[p932,p52]) ).

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