↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : HEN012-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 : n014.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:37:11 PM UTC 2026

% Result   : Unsatisfiable 25.89s 3.75s
% Output   : Proof 25.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   71 (  51 unt;   0 def)
%            Number of atoms       :  111 (  42 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   86 (  46   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   2 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-4 aty)
%            Number of variables   :  141 (  13 sgn  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,axiom,
    ( less_equal(X,Y)
    | ~ quotient(X,Y,zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_quotient) ).

fof(f1_nnf,plain,
    ! [X,Y] :
      ( less_equal(X,Y)
      | ~ quotient(X,Y,zero) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y] :
      ( less_equal(X,Y)
      | ~ quotient(X,Y,zero) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( less_equal(X0,X1)
    | ~ quotient(X0,X1,zero) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(t194,plain,
    ifeq(quotient(X1,X2,zero),true,less_equal(X1,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t535,plain,
    ifeq(quotient(X1,X2,zero),true,less_equal(X1,X2),true) = true,
    inference(orient,[status(thm)],[t194]) ).

cnf(f7,axiom,
    quotient(X,Y,divide(X,Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure) ).

fof(f7_nnf,plain,
    ! [X,Y] : quotient(X,Y,divide(X,Y)),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y] : quotient(X,Y,divide(X,Y)),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    quotient(X0,X1,divide(X0,X1)),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(t19,plain,
    quotient(X1,X2,divide(X1,X2)) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t396,plain,
    quotient(X1,X2,divide(X1,X2)) = true,
    inference(orient,[status(thm)],[t19]) ).

cnf(f5,axiom,
    ( X = Y
    | ~ less_equal(Y,X)
    | ~ less_equal(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_and_equal) ).

fof(f5_nnf,plain,
    ! [X,Y] :
      ( X = Y
      | ~ less_equal(Y,X)
      | ~ less_equal(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X,Y] :
      ( X = Y
      | ~ less_equal(Y,X)
      | ~ less_equal(X,Y) ),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ( X0 = X1
    | ~ less_equal(X1,X0)
    | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(t253,plain,
    ifeq(less_equal(X1,X2),true,ifeq(less_equal(X2,X1),true,X1,X2),X2) = X2,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t259,plain,
    ifeq(less_equal(X1,X2),true,ifeq(less_equal(X2,X1),true,X1,X2),X2) = X2,
    inference(orient,[status(thm)],[t253]) ).

cnf(f2,axiom,
    ( less_equal(Z,X)
    | ~ quotient(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_existence) ).

fof(f2_nnf,plain,
    ! [X,Y,Z] :
      ( less_equal(Z,X)
      | ~ quotient(X,Y,Z) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y,Z] :
      ( less_equal(Z,X)
      | ~ quotient(X,Y,Z) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( less_equal(X2,X0)
    | ~ quotient(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    ifeq(quotient(X0,X1,X2),true,less_equal(X2,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(hi7,axiom,
    quotient(X0,X1,divide(X0,X1)) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(h3,plain,
    less_equal(divide(V0,V1),V0) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi7]) ).

cnf(f0,axiom,
    ( quotient(X,Y,zero)
    | ~ less_equal(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( quotient(X,Y,zero)
      | ~ less_equal(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( quotient(X,Y,zero)
      | ~ less_equal(X,Y) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( quotient(X0,X1,zero)
    | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(less_equal(X0,X1),true,quotient(X0,X1,zero),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(h47,plain,
    quotient(divide(V0,V1),V0,zero) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h3]) ).

cnf(f3,axiom,
    ( less_equal(V4,V5)
    | ~ quotient(V1,Z,V5)
    | ~ quotient(V3,V2,V4)
    | ~ quotient(X,Z,V3)
    | ~ quotient(Y,Z,V2)
    | ~ quotient(X,Y,V1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).

fof(f3_nnf,plain,
    ! [X,Y,V1,Z,V2,V3,V4,V5] :
      ( less_equal(V4,V5)
      | ~ quotient(V1,Z,V5)
      | ~ quotient(V3,V2,V4)
      | ~ quotient(X,Z,V3)
      | ~ quotient(Y,Z,V2)
      | ~ quotient(X,Y,V1) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X,Y,V1,Z,V2,V3,V4,V5] :
      ( less_equal(V4,V5)
      | ~ quotient(V1,Z,V5)
      | ~ quotient(V3,V2,V4)
      | ~ quotient(X,Z,V3)
      | ~ quotient(Y,Z,V2)
      | ~ quotient(X,Y,V1) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( less_equal(X6,X7)
    | ~ quotient(X2,X3,X7)
    | ~ quotient(X5,X4,X6)
    | ~ quotient(X0,X3,X5)
    | ~ quotient(X1,X3,X4)
    | ~ quotient(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    ifeq(quotient(X0,X1,X2),true,ifeq(quotient(X1,X3,X4),true,ifeq(quotient(X0,X3,X5),true,ifeq(quotient(X5,X4,X6),true,ifeq(quotient(X2,X3,X7),true,less_equal(X6,X7),true),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(h171,plain,
    less_equal(divide(divide(V0,V0),zero),zero) = true,
    inference(hyper_resolution,[status(thm)],[hi3,hi7,h47,hi7,hi7,h47]) ).

cnf(h224,plain,
    less_equal(zero,divide(V0,V1)) = true,
    inference(hyper_resolution,[status(thm)],[hi2,h47]) ).

cnf(hi5,axiom,
    ifeq(less_equal(X0,X1),true,ifeq(less_equal(X1,X0),true,X0,X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t6,plain,
    divide(divide(X1,X1),zero) = zero,
    inference(hyper_resolution,[status(thm)],[hi5,h224,h171]) ).

cnf(t300,plain,
    divide(divide(X1,X1),zero) = zero,
    inference(orient,[status(thm)],[t6]) ).

cnf(t409,plain,
    true = quotient(divide(X1,X1),zero,zero),
    inference(cp,[status(thm)],[t396,t300]) ).

cnf(t573,plain,
    quotient(divide(X1,X1),zero,zero) = true,
    inference(orient,[status(thm)],[t409]) ).

cnf(t575,plain,
    true = ifeq(true,true,less_equal(divide(X1,X1),zero),true),
    inference(cp,[status(thm)],[t535,t573]) ).

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

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

cnf(t614,plain,
    true = less_equal(divide(X1,X1),zero),
    inference(step,[status(thm)],[t575,t256]) ).

cnf(t583,plain,
    less_equal(divide(X1,X1),zero) = true,
    inference(orient,[status(thm)],[t614]) ).

cnf(t585,plain,
    zero = ifeq(true,true,ifeq(less_equal(zero,divide(X1,X1)),true,divide(X1,X1),zero),zero),
    inference(cp,[status(thm)],[t259,t583]) ).

cnf(t615,plain,
    zero = ifeq(less_equal(zero,divide(X1,X1)),true,divide(X1,X1),zero),
    inference(step,[status(thm)],[t585,t256]) ).

cnf(f4,axiom,
    less_equal(zero,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).

fof(f4_nnf,plain,
    ! [X] : less_equal(zero,X),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X] : less_equal(zero,X),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    less_equal(zero,X0),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t3,plain,
    less_equal(zero,X1) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t463,plain,
    less_equal(zero,X1) = true,
    inference(orient,[status(thm)],[t3]) ).

cnf(t616,plain,
    zero = ifeq(true,true,divide(X1,X1),zero),
    inference(step,[status(thm)],[t615,t463]) ).

cnf(t617,plain,
    zero = divide(X1,X1),
    inference(step,[status(thm)],[t616,t256]) ).

cnf(t588,plain,
    divide(X1,X1) = zero,
    inference(orient,[status(thm)],[t617]) ).

cnf(t589,plain,
    true = quotient(X1,X1,zero),
    inference(cp,[status(thm)],[t396,t588]) ).

cnf(t597,plain,
    quotient(X1,X1,zero) = true,
    inference(orient,[status(thm)],[t589]) ).

cnf(t599,plain,
    true = ifeq(true,true,less_equal(X1,X1),true),
    inference(cp,[status(thm)],[t535,t597]) ).

cnf(t621,plain,
    true = less_equal(X1,X1),
    inference(step,[status(thm)],[t599,t256]) ).

cnf(t607,plain,
    less_equal(X1,X1) = true,
    inference(orient,[status(thm)],[t621]) ).

cnf(f9,negated_conjecture,
    ~ less_equal(x,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_X_less_than_or_equal_to_X) ).

fof(f9_nnf,plain,
    ~ less_equal(x,x),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ~ less_equal(x,x),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ~ less_equal(x,x),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(goal_0,negated_conjecture,
    less_equal(x,x) != true,
    inference(equality_encoding,[status(esa)],[c9]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HEN012-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n014.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 16:18:04 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 25.89/3.75  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 25.89/3.75  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------