↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP021-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 : n016.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:57 PM UTC 2026

% Result   : Unsatisfiable 0.15s 5.87s
% Output   : Proof 0.15s
% 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    :    6 (   6 usr;   3 con; 0-4 aty)
%            Number of variables   :   37 (   0 sgn  14   !;   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(f3,axiom,
    product(X,inverse(X),identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).

fof(f3_nnf,plain,
    ! [X] : product(X,inverse(X),identity),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X] : product(X,inverse(X),identity),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    product(X0,inverse(X0),identity),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    product(X0,inverse(X0),identity) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(f4,axiom,
    product(X,Y,multiply(X,Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_function1) ).

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

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

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

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

cnf(t1,plain,
    multiply(X1,inverse(X1)) = identity,
    inference(hyper_resolution,[status(thm)],[hi5,hi3,hi4]) ).

cnf(t99,plain,
    multiply(X1,inverse(X1)) = identity,
    inference(orient,[status(thm)],[t1]) ).

cnf(f8,negated_conjecture,
    multiply(a,inverse(a)) != identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_X_times_inverse_X_is_id) ).

fof(f8_nnf,plain,
    multiply(a,inverse(a)) != identity,
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    multiply(a,inverse(a)) != identity,
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    multiply(a,inverse(a)) != identity,
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(goal_0,negated_conjecture,
    multiply(a,inverse(a)) != identity,
    inference(equality_encoding,[status(esa)],[c8]) ).

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

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

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