↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KLE021+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 : n008.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 25.62s 3.87s
% Output   : Proof 25.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  17 unt;   0 def)
%            Number of atoms       :   47 (  20 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   36 (  17   ~;  10   |;   6   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 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   :   45 (   0 sgn  28   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
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]) ).

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

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

cnf(p50,plain,
    multiplication(addition(X0,X1),X2) = multiplication(addition(X1,X0),X2),
    inference(demodulation,[status(thm)],[p49,c8]) ).

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

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

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

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

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

cnf(p51,plain,
    ( ~ leq(multiplication(addition(c(sk2),sk2),sk1),sk1)
    | ~ leq(sk1,multiplication(addition(c(sk2),sk2),sk1)) ),
    inference(demodulation,[status(thm)],[p49,c23]) ).

cnf(p483,plain,
    ( ~ leq(sk1,sk1)
    | ~ leq(sk1,sk1) ),
    inference(superposition,[status(thm)],[p50,p51]) ).

cnf(p505,plain,
    ~ leq(sk1,sk1),
    inference(factoring,[status(thm)],[p483]) ).

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(p39,plain,
    leq(X0,X0),
    inference(resolution,[status(thm)],[c12,c3]) ).

cnf(p506,plain,
    $false,
    inference(resolution,[status(thm)],[p505,p39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE021+2 : 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.37  % Computer : n008.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Wed Sep 23 18:39:08 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 25.62/3.87  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 25.62/3.87  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------