↑ Up

FindProof---0.1.UNS-Prf.s

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

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

% Result   : Unsatisfiable 8.87s 1.76s
% Output   : Proof 8.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   50 (  42 unt;   0 def)
%            Number of atoms       :   78 (  15 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   62 (  34   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-4 aty)
%            Number of variables   :   90 (   0 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f13,axiom,
    ( sum(V1,V2,V4)
    | ~ product(V3,X,V4)
    | ~ sum(Y,Z,V3)
    | ~ product(Z,X,V2)
    | ~ product(Y,X,V1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity3) ).

fof(f13_nnf,plain,
    ! [Y,X,V1,Z,V2,V3,V4] :
      ( sum(V1,V2,V4)
      | ~ product(V3,X,V4)
      | ~ sum(Y,Z,V3)
      | ~ product(Z,X,V2)
      | ~ product(Y,X,V1) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [Y,X,V1,Z,V2,V3,V4] :
      ( sum(V1,V2,V4)
      | ~ product(V3,X,V4)
      | ~ sum(Y,Z,V3)
      | ~ product(Z,X,V2)
      | ~ product(Y,X,V1) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    ( sum(X2,X4,X6)
    | ~ product(X5,X1,X6)
    | ~ sum(X0,X3,X5)
    | ~ product(X3,X1,X4)
    | ~ product(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(hi13,axiom,
    ifeq(product(X0,X1,X2),true,ifeq(product(X3,X1,X4),true,ifeq(sum(X0,X3,X5),true,ifeq(product(X5,X1,X6),true,sum(X2,X4,X6),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(f18,hypothesis,
    product(additive_inverse(a),b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b) ).

fof(f18_nnf,plain,
    product(additive_inverse(a),b,c),
    inference(nnf_transformation,[status(thm)],[f18]) ).

cnf(c18,plain,
    product(additive_inverse(a),b,c),
    inference(cnf_transformation,[status(esa)],[f18_nnf]) ).

cnf(hi18,axiom,
    product(additive_inverse(a),b,c) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(f2,axiom,
    product(X,Y,multiply(X,Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure_of_multiplication) ).

fof(f2_nnf,plain,
    ! [X,Y] : product(X,Y,multiply(X,Y)),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y] : product(X,Y,multiply(X,Y)),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    product(X0,X1,multiply(X0,X1)),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    product(X0,X1,multiply(X0,X1)) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(f1,axiom,
    sum(X,additive_identity,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity2) ).

fof(f1_nnf,plain,
    ! [X] : sum(X,additive_identity,X),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X] : sum(X,additive_identity,X),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    sum(X0,additive_identity,X0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    sum(X0,additive_identity,X0) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(h31,plain,
    sum(c,multiply(additive_identity,b),c) = true,
    inference(hyper_resolution,[status(thm)],[hi13,hi18,hi2,hi1,hi18]) ).

cnf(f7,axiom,
    ( sum(U,Z,W)
    | ~ sum(X,V,W)
    | ~ sum(Y,Z,V)
    | ~ sum(X,Y,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_addition2) ).

fof(f7_nnf,plain,
    ! [X,Y,U,Z,V,W] :
      ( sum(U,Z,W)
      | ~ sum(X,V,W)
      | ~ sum(Y,Z,V)
      | ~ sum(X,Y,U) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y,U,Z,V,W] :
      ( sum(U,Z,W)
      | ~ sum(X,V,W)
      | ~ sum(Y,Z,V)
      | ~ sum(X,Y,U) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ( sum(X2,X3,X5)
    | ~ sum(X0,X4,X5)
    | ~ sum(X1,X3,X4)
    | ~ sum(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(hi7,axiom,
    ifeq(sum(X0,X1,X2),true,ifeq(sum(X1,X3,X4),true,ifeq(sum(X0,X4,X5),true,sum(X2,X3,X5),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(f4,axiom,
    sum(additive_inverse(X),X,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).

fof(f4_nnf,plain,
    ! [X] : sum(additive_inverse(X),X,additive_identity),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X] : sum(additive_inverse(X),X,additive_identity),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    sum(additive_inverse(X0),X0,additive_identity),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi4,axiom,
    sum(additive_inverse(X0),X0,additive_identity) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(h325,plain,
    sum(additive_identity,multiply(additive_identity,b),additive_identity) = true,
    inference(hyper_resolution,[status(thm)],[hi7,hi4,h31,hi4]) ).

cnf(f17,hypothesis,
    product(a,b,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).

fof(f17_nnf,plain,
    product(a,b,d),
    inference(nnf_transformation,[status(thm)],[f17]) ).

cnf(c17,plain,
    product(a,b,d),
    inference(cnf_transformation,[status(esa)],[f17_nnf]) ).

cnf(hi17,axiom,
    product(a,b,d) = true,
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(h24,plain,
    sum(c,d,multiply(additive_identity,b)) = true,
    inference(hyper_resolution,[status(thm)],[hi13,hi18,hi17,hi4,hi2]) ).

cnf(f0,axiom,
    sum(additive_identity,X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity1) ).

fof(f0_nnf,plain,
    ! [X] : sum(additive_identity,X,X),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] : sum(additive_identity,X,X),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    sum(additive_identity,X0,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    sum(additive_identity,X0,X0) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t19,plain,
    sum(c,d,additive_identity) = true,
    inference(hyper_resolution,[status(thm)],[hi7,hi0,h24,h325]) ).

cnf(t297,plain,
    sum(c,d,additive_identity) = true,
    inference(orient,[status(thm)],[t19]) ).

cnf(f19,negated_conjecture,
    ~ sum(c,d,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sum_is_additive_id) ).

fof(f19_nnf,plain,
    ~ sum(c,d,additive_identity),
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    ~ sum(c,d,additive_identity),
    inference(skolemisation,[status(esa)],[f19_nnf]) ).

cnf(c19,plain,
    ~ sum(c,d,additive_identity),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

cnf(goal_0,negated_conjecture,
    sum(c,d,additive_identity) != true,
    inference(equality_encoding,[status(esa)],[c19]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t297]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35  % Computer : n007.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 07:39:52 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.87/1.76  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.87/1.76  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------