↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n009.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:36:56 PM UTC 2026

% Result   : Unsatisfiable 6.03s 11.18s
% Output   : Proof 6.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   4 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f4,axiom,
    divide(X,identity) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_is_largest) ).

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

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

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

cnf(t0,plain,
    divide(X1,identity) = zero,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t8,plain,
    divide(X1,identity) = zero,
    inference(orient,[status(thm)],[t0]) ).

cnf(f5,negated_conjecture,
    divide(a,identity) != zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_everything_divide_id_is_zero) ).

fof(f5_nnf,plain,
    divide(a,identity) != zero,
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    divide(a,identity) != zero,
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    divide(a,identity) != zero,
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(goal_0,negated_conjecture,
    divide(a,identity) != zero,
    inference(equality_encoding,[status(esa)],[c5]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HEN001-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/10.38  % Computer : n009.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Wed Sep 23 16:08:38 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.03/11.18  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.03/11.18  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------