↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 5.99s 1.16s
% Output   : Proof 5.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  27 unt;   0 def)
%            Number of atoms       :   39 (  14 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    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-4 aty)
%            Number of variables   :   63 (   9 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( is_a_theorem(Y)
    | ~ is_a_theorem(X)
    | ~ is_a_theorem(implies(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(implies(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(implies(X,Y)) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

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

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

cnf(f1,axiom,
    is_a_theorem(implies(X,implies(Y,X))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).

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

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

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

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

cnf(h6,plain,
    is_a_theorem(implies(V0,implies(V1,implies(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,hi1]) ).

cnf(f3,axiom,
    is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_6) ).

fof(f3_nnf,plain,
    ! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

cnf(h21,plain,
    is_a_theorem(implies(implies(V0,implies(implies(V1,V0),V2)),implies(V0,V2))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h0,h6]) ).

cnf(h98,plain,
    is_a_theorem(implies(V0,implies(implies(V1,implies(implies(V2,V1),V3)),implies(V1,V3)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,h21]) ).

cnf(h1541,plain,
    is_a_theorem(implies(implies(implies(V0,V1),V2),implies(V1,V2))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h21,h98]) ).

cnf(h1599,plain,
    is_a_theorem(implies(implies(V0,V1),implies(implies(V2,V0),implies(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h1541,hi3]) ).

cnf(h1609,plain,
    is_a_theorem(implies(implies(implies(V0,V1),implies(V2,V0)),implies(implies(V0,V1),implies(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi3,h1599]) ).

cnf(t24,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
    inference(hyper_resolution,[status(thm)],[hi0,h1541,h1609]) ).

cnf(t271,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
    inference(orient,[status(thm)],[t24]) ).

cnf(f4,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_1) ).

fof(f4_nnf,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(goal_0,negated_conjecture,
    is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))) != true,
    inference(equality_encoding,[status(esa)],[c4]) ).

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

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

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