↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL097-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 : n008.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 02:00:56 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( is_a_theorem(Y)
    | ~ is_a_theorem(X)
    | ~ is_a_theorem(equivalent(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

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

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

cnf(c0,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(X0)
    | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(f2,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).

fof(f2_nnf,plain,
    ! [X,Y,Z,U,V] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y,Z,U,V] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h0,plain,
    is_a_theorem(equivalent(equivalent(equivalent(V0,V1),V2),equivalent(equivalent(V3,V1),equivalent(equivalent(V0,V3),V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,hi2]) ).

cnf(h3,plain,
    is_a_theorem(equivalent(equivalent(V0,V1),equivalent(equivalent(equivalent(equivalent(V2,V3),equivalent(V2,V4)),V0),equivalent(equivalent(V3,V4),V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,h0]) ).

cnf(f1,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).

fof(f1_nnf,plain,
    ! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(h1,plain,
    is_a_theorem(equivalent(equivalent(V0,V1),equivalent(V0,V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,hi1]) ).

cnf(h7,plain,
    is_a_theorem(equivalent(equivalent(V0,V1),equivalent(equivalent(V2,V0),equivalent(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h0,h1]) ).

cnf(h12,plain,
    is_a_theorem(equivalent(equivalent(V0,equivalent(equivalent(equivalent(V1,V2),equivalent(V1,V3)),V4)),equivalent(V0,equivalent(equivalent(V2,V3),V4)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,h7]) ).

cnf(t43,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h12,h3]) ).

cnf(t234,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
    inference(orient,[status(thm)],[t43]) ).

cnf(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_4) ).

fof(f3_nnf,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))) != true,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.43  % Computer : n008.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Wed Sep 23 21:54:55 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.44  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.43/1.18  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/1.18  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------