↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : FLD065-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n013.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:15:07 PM UTC 2026

% Result   : Unsatisfiable 5.90s 1.24s
% Output   : Proof 5.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   44 (  32 unt;   0 def)
%            Number of atoms       :   64 (  17 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  30   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-4 aty)
%            Number of variables   :   41 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f28,negated_conjecture,
    ~ less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_3) ).

fof(f28_nnf,plain,
    ~ less_or_equal(additive_identity,a),
    inference(nnf_transformation,[status(thm)],[f28]) ).

fof(f28_sk,plain,
    ~ less_or_equal(additive_identity,a),
    inference(skolemisation,[status(esa)],[f28_nnf]) ).

cnf(c28,plain,
    ~ less_or_equal(additive_identity,a),
    inference(cnf_transformation,[status(esa)],[f28_sk]) ).

cnf(t99,plain,
    ifeq(less_or_equal(additive_identity,a),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c28]) ).

cnf(f2,axiom,
    ( ~ defined(X)
    | sum(additive_identity,X,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_identity_addition) ).

fof(f2_nnf,plain,
    ! [X] :
      ( ~ defined(X)
      | sum(additive_identity,X,X) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] :
      ( ~ defined(X)
      | sum(additive_identity,X,X) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ defined(X0)
    | sum(additive_identity,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    ifeq(defined(X0),true,sum(additive_identity,X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(f26,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

fof(f26_nnf,plain,
    defined(a),
    inference(nnf_transformation,[status(thm)],[f26]) ).

cnf(c26,plain,
    defined(a),
    inference(cnf_transformation,[status(esa)],[f26_nnf]) ).

cnf(hi25,axiom,
    defined(a) = true,
    inference(equality_encoding,[status(esa)],[c26]) ).

cnf(h62,plain,
    sum(additive_identity,a,a) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi25]) ).

cnf(f3,axiom,
    ( ~ defined(X)
    | sum(additive_inverse(X),X,additive_identity) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_inverse_addition) ).

fof(f3_nnf,plain,
    ! [X] :
      ( ~ defined(X)
      | sum(additive_inverse(X),X,additive_identity) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X] :
      ( ~ defined(X)
      | sum(additive_inverse(X),X,additive_identity) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ defined(X0)
    | sum(additive_inverse(X0),X0,additive_identity) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    ifeq(defined(X0),true,sum(additive_inverse(X0),X0,additive_identity),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(h61,plain,
    sum(additive_inverse(a),a,additive_identity) = true,
    inference(hyper_resolution,[status(thm)],[hi3,hi25]) ).

cnf(f23,axiom,
    ( ~ sum(Y,Z,V)
    | ~ sum(X,Z,U)
    | ~ less_or_equal(X,Y)
    | less_or_equal(U,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_order_relation_and_addition) ).

fof(f23_nnf,plain,
    ! [U,V,X,Y,Z] :
      ( ~ sum(Y,Z,V)
      | ~ sum(X,Z,U)
      | ~ less_or_equal(X,Y)
      | less_or_equal(U,V) ),
    inference(nnf_transformation,[status(thm)],[f23]) ).

fof(f23_sk,plain,
    ! [U,V,X,Y,Z] :
      ( ~ sum(Y,Z,V)
      | ~ sum(X,Z,U)
      | ~ less_or_equal(X,Y)
      | less_or_equal(U,V) ),
    inference(skolemisation,[status(esa)],[f23_nnf]) ).

cnf(c23,plain,
    ( ~ sum(X3,X4,X1)
    | ~ sum(X2,X4,X0)
    | ~ less_or_equal(X2,X3)
    | less_or_equal(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f23_sk]) ).

cnf(hi23,axiom,
    ifeq(less_or_equal(X0,X1),true,ifeq(sum(X0,X2,X3),true,ifeq(sum(X1,X2,X4),true,less_or_equal(X3,X4),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c23]) ).

cnf(f27,negated_conjecture,
    less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_2) ).

fof(f27_nnf,plain,
    less_or_equal(additive_inverse(a),additive_identity),
    inference(nnf_transformation,[status(thm)],[f27]) ).

cnf(c27,plain,
    less_or_equal(additive_inverse(a),additive_identity),
    inference(cnf_transformation,[status(esa)],[f27_nnf]) ).

cnf(hi26,negated_conjecture,
    less_or_equal(additive_inverse(a),additive_identity) = true,
    inference(equality_encoding,[status(esa)],[c27]) ).

cnf(t7,plain,
    less_or_equal(additive_identity,a) = true,
    inference(hyper_resolution,[status(thm)],[hi23,hi26,h61,h62]) ).

cnf(t259,plain,
    less_or_equal(additive_identity,a) = true,
    inference(orient,[status(thm)],[t7]) ).

cnf(t688,plain,
    ifeq(true,true,false,true) = true,
    inference(step,[status(thm)],[t99,t259]) ).

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

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

cnf(t689,plain,
    false = true,
    inference(step,[status(thm)],[t688,t258]) ).

cnf(t685,plain,
    false = true,
    inference(orient,[status(thm)],[t689]) ).

cnf(f25,axiom,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',different_identities) ).

fof(f25_nnf,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(nnf_transformation,[status(thm)],[f25]) ).

fof(f25_sk,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(skolemisation,[status(esa)],[f25_nnf]) ).

cnf(c25,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(cnf_transformation,[status(esa)],[f25_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c25,c28]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD065-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n013.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 11:01:06 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.90/1.24  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.90/1.24  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------