↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 3.30s 0.85s
% Output   : Proof 3.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   79 (  74 unt;   0 def)
%            Number of atoms       :   88 (  80 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  15   ~;   6   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :  115 (  11 sgn  46   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f16,axiom,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).

fof(f16_nnf,plain,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c17,plain,
    domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(t15,plain,
    addition(domain(X1),domain(X2)) = domain(addition(X1,X2)),
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(t59,plain,
    addition(domain(X1),domain(X2)) = domain(addition(X1,X2)),
    inference(orient,[status(thm)],[t15]) ).

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(t12,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t32,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(orient,[status(thm)],[t12]) ).

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(t22,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t53,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    inference(orient,[status(thm)],[t22]) ).

fof(f5,axiom,
    ! [A] : multiplication(A,one) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).

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

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

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

cnf(t6,plain,
    multiplication(X1,one) = X1,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t26,plain,
    multiplication(X1,one) = X1,
    inference(orient,[status(thm)],[t6]) ).

cnf(t55,plain,
    multiplication(X1,addition(one,X2)) = addition(X1,multiplication(X1,X2)),
    inference(cp,[status(thm)],[t53,t26]) ).

cnf(t254,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
    inference(orient,[status(thm)],[t55]) ).

fof(f13,axiom,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).

fof(f13_nnf,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c14,plain,
    domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(t16,plain,
    domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
    inference(equality_encoding,[status(esa)],[c14]) ).

cnf(t76,plain,
    domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
    inference(orient,[status(thm)],[t16]) ).

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(c11,plain,
    ( addition(X0,X1) = X1
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(t20,plain,
    ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(t29,plain,
    ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
    inference(orient,[status(thm)],[t20]) ).

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

cnf(hi12,axiom,
    ifeq(addition(X0,X1),X1,leq(X0,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c12]) ).

fof(f12,axiom,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).

fof(f12_nnf,plain,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c13,plain,
    addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(hi13,axiom,
    addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(t14,plain,
    leq(X1,multiplication(domain(X1),X1)) = true,
    inference(hyper_resolution,[status(thm)],[hi12,hi13]) ).

cnf(t84,plain,
    leq(X1,multiplication(domain(X1),X1)) = true,
    inference(orient,[status(thm)],[t14]) ).

cnf(t85,plain,
    true = leq(one,domain(one)),
    inference(cp,[status(thm)],[t84,t26]) ).

cnf(t109,plain,
    leq(one,domain(one)) = true,
    inference(orient,[status(thm)],[t85]) ).

cnf(t110,plain,
    domain(one) = ifeq(true,true,addition(one,domain(one)),domain(one)),
    inference(cp,[status(thm)],[t29,t109]) ).

cnf(t13,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t28,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t13]) ).

cnf(t269,plain,
    domain(one) = addition(one,domain(one)),
    inference(step,[status(thm)],[t110,t28]) ).

fof(f14,axiom,
    ! [X0] : addition(domain(X0),one) = one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).

fof(f14_nnf,plain,
    ! [X0] : addition(domain(X0),one) = one,
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [X0] : addition(domain(X0),one) = one,
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c15,plain,
    addition(domain(X0),one) = one,
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(t10,plain,
    addition(domain(X1),one) = one,
    inference(equality_encoding,[status(esa)],[c15]) ).

cnf(t266,plain,
    addition(one,domain(X1)) = one,
    inference(step,[status(thm)],[t10,t32]) ).

cnf(t63,plain,
    addition(one,domain(X1)) = one,
    inference(orient,[status(thm)],[t266]) ).

cnf(t270,plain,
    domain(one) = one,
    inference(step,[status(thm)],[t269,t63]) ).

cnf(t112,plain,
    domain(one) = one,
    inference(orient,[status(thm)],[t270]) ).

cnf(t113,plain,
    domain(addition(one,X1)) = addition(one,domain(X1)),
    inference(cp,[status(thm)],[t59,t112]) ).

cnf(t271,plain,
    domain(addition(one,X1)) = one,
    inference(step,[status(thm)],[t113,t63]) ).

cnf(t115,plain,
    domain(addition(one,X1)) = one,
    inference(orient,[status(thm)],[t271]) ).

cnf(t119,plain,
    domain(multiplication(X1,addition(one,X2))) = domain(multiplication(X1,one)),
    inference(cp,[status(thm)],[t76,t115]) ).

cnf(t278,plain,
    domain(multiplication(X1,addition(one,X2))) = domain(X1),
    inference(step,[status(thm)],[t119,t26]) ).

cnf(t204,plain,
    domain(multiplication(X1,addition(one,X2))) = domain(X1),
    inference(orient,[status(thm)],[t278]) ).

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

fof(f17_neg,negated_conjecture,
    ~ ! [X0,X1] : addition(domain(multiplication(X0,X1)),domain(X0)) = domain(X0),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f17_nnf,plain,
    ? [X0,X1] : addition(domain(multiplication(X0,X1)),domain(X0)) != domain(X0),
    inference(nnf_transformation,[status(thm)],[f17_neg]) ).

fof(f17_sk,plain,
    addition(domain(multiplication(sk0,sk1)),domain(sk0)) != domain(sk0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f17_nnf]) ).

cnf(c18,plain,
    addition(domain(multiplication(sk0,sk1)),domain(sk0)) != domain(sk0),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(goal_0,negated_conjecture,
    addition(domain(multiplication(sk0,sk1)),domain(sk0)) != domain(sk0),
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(g0_0,plain,
    domain(addition(multiplication(sk0,sk1),sk0)) != domain(sk0),
    inference(rw,[status(thm)],[goal_0,t59]) ).

cnf(g0_1,plain,
    domain(addition(sk0,multiplication(sk0,sk1))) != domain(sk0),
    inference(rw,[status(thm)],[g0_0,t32]) ).

cnf(g0_2,plain,
    domain(multiplication(sk0,addition(one,sk1))) != domain(sk0),
    inference(rw,[status(thm)],[g0_1,t254]) ).

cnf(g0_3,plain,
    domain(sk0) != domain(sk0),
    inference(rw,[status(thm)],[g0_2,t204]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).

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