↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n010.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:24:54 PM UTC 2026

% Result   : Unsatisfiable 4.85s 1.18s
% Output   : Proof 4.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  20 unt;   0 def)
%            Number of atoms       :   32 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   30 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f5,axiom,
    ( Z = W
    | ~ product(X,Y,W)
    | ~ product(X,Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_function2) ).

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

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

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

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

cnf(f1,axiom,
    product(X,identity,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).

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

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

cnf(c1,plain,
    product(X0,identity,X0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

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

cnf(f8,hypothesis,
    product(c,A,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',another_left_identity) ).

fof(f8_nnf,plain,
    ! [A] : product(c,A,A),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A] : product(c,A,A),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    product(c,X0,X0),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(hi8,axiom,
    product(c,X0,X0) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t0,plain,
    identity = c,
    inference(hyper_resolution,[status(thm)],[hi5,hi1,hi8]) ).

cnf(t169,plain,
    c = identity,
    inference(orient,[status(thm)],[t0]) ).

cnf(f10,negated_conjecture,
    identity != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_identity_equals_c) ).

fof(f10_nnf,plain,
    identity != c,
    inference(nnf_transformation,[status(thm)],[f10]) ).

fof(f10_sk,plain,
    identity != c,
    inference(skolemisation,[status(esa)],[f10_nnf]) ).

cnf(c10,plain,
    identity != c,
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(goal_0,negated_conjecture,
    identity != c,
    inference(equality_encoding,[status(esa)],[c10]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Wed Sep 23 13:12:27 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.85/1.18  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.85/1.18  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------