↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n011.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 03:34:14 PM UTC 2026

% Result   : Unsatisfiable 7.47s 1.49s
% Output   : Proof 7.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   62 (  34 unt;   0 def)
%            Number of atoms       :  102 (  20 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   86 (  46   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   80 (  12 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f137,axiom,
    ( ~ n0(D,C)
    | q1(C,C,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_100) ).

fof(f137_nnf,plain,
    ! [C,D] :
      ( ~ n0(D,C)
      | q1(C,C,C) ),
    inference(nnf_transformation,[status(thm)],[f137]) ).

fof(f137_sk,plain,
    ! [C,D] :
      ( ~ n0(D,C)
      | q1(C,C,C) ),
    inference(skolemisation,[status(esa)],[f137_nnf]) ).

cnf(c137,plain,
    ( ~ n0(X1,X0)
    | q1(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f137_sk]) ).

cnf(hi135,axiom,
    ifeq(n0(X0,X1),true,q1(X1,X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c137]) ).

cnf(f2,axiom,
    n0(d,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f2_nnf,plain,
    n0(d,e),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    n0(d,e),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,axiom,
    n0(d,e) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h3,plain,
    q1(e,e,e) = true,
    inference(hyper_resolution,[status(thm)],[hi135,hi2]) ).

cnf(f166,axiom,
    ( ~ q1(A,J,J)
    | k2(J,J) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_129) ).

fof(f166_nnf,plain,
    ! [J,A] :
      ( ~ q1(A,J,J)
      | k2(J,J) ),
    inference(nnf_transformation,[status(thm)],[f166]) ).

fof(f166_sk,plain,
    ! [J,A] :
      ( ~ q1(A,J,J)
      | k2(J,J) ),
    inference(skolemisation,[status(esa)],[f166_nnf]) ).

cnf(c166,plain,
    ( ~ q1(X1,X0,X0)
    | k2(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f166_sk]) ).

cnf(hi164,axiom,
    ifeq(q1(X0,X1,X1),true,k2(X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c166]) ).

cnf(h132,plain,
    k2(e,e) = true,
    inference(hyper_resolution,[status(thm)],[hi164,h3]) ).

cnf(f38,axiom,
    ( ~ n0(J,I)
    | k1(I) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_001) ).

fof(f38_nnf,plain,
    ! [I,J] :
      ( ~ n0(J,I)
      | k1(I) ),
    inference(nnf_transformation,[status(thm)],[f38]) ).

fof(f38_sk,plain,
    ! [I,J] :
      ( ~ n0(J,I)
      | k1(I) ),
    inference(skolemisation,[status(esa)],[f38_nnf]) ).

cnf(c38,plain,
    ( ~ n0(X1,X0)
    | k1(X0) ),
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

cnf(hi38,axiom,
    ifeq(n0(X0,X1),true,k1(X1),true) = true,
    inference(equality_encoding,[status(esa)],[c38]) ).

cnf(h6,plain,
    k1(e) = true,
    inference(hyper_resolution,[status(thm)],[hi38,hi2]) ).

cnf(f58,axiom,
    ( ~ k0(J)
    | ~ l0(I)
    | m1(I,J,I) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_021) ).

fof(f58_nnf,plain,
    ! [I,J] :
      ( ~ k0(J)
      | ~ l0(I)
      | m1(I,J,I) ),
    inference(nnf_transformation,[status(thm)],[f58]) ).

fof(f58_sk,plain,
    ! [I,J] :
      ( ~ k0(J)
      | ~ l0(I)
      | m1(I,J,I) ),
    inference(skolemisation,[status(esa)],[f58_nnf]) ).

cnf(c58,plain,
    ( ~ k0(X1)
    | ~ l0(X0)
    | m1(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f58_sk]) ).

cnf(hi58,axiom,
    ifeq(l0(X0),true,ifeq(k0(X1),true,m1(X0,X1,X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c58]) ).

cnf(f23,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_24) ).

fof(f23_nnf,plain,
    l0(c),
    inference(nnf_transformation,[status(thm)],[f23]) ).

cnf(c23,plain,
    l0(c),
    inference(cnf_transformation,[status(esa)],[f23_nnf]) ).

cnf(hi23,axiom,
    l0(c) = true,
    inference(equality_encoding,[status(esa)],[c23]) ).

cnf(f27,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_28) ).

fof(f27_nnf,plain,
    k0(e),
    inference(nnf_transformation,[status(thm)],[f27]) ).

cnf(c27,plain,
    k0(e),
    inference(cnf_transformation,[status(esa)],[f27_nnf]) ).

cnf(hi27,axiom,
    k0(e) = true,
    inference(equality_encoding,[status(esa)],[c27]) ).

cnf(h77,plain,
    m1(c,e,c) = true,
    inference(hyper_resolution,[status(thm)],[hi58,hi23,hi27]) ).

cnf(f164,axiom,
    ( ~ k2(F,D)
    | ~ k1(F)
    | ~ m1(E,D,C)
    | k2(C,D) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_127) ).

fof(f164_nnf,plain,
    ! [C,D,E,F] :
      ( ~ k2(F,D)
      | ~ k1(F)
      | ~ m1(E,D,C)
      | k2(C,D) ),
    inference(nnf_transformation,[status(thm)],[f164]) ).

fof(f164_sk,plain,
    ! [C,D,E,F] :
      ( ~ k2(F,D)
      | ~ k1(F)
      | ~ m1(E,D,C)
      | k2(C,D) ),
    inference(skolemisation,[status(esa)],[f164_nnf]) ).

cnf(c164,plain,
    ( ~ k2(X3,X1)
    | ~ k1(X3)
    | ~ m1(X2,X1,X0)
    | k2(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f164_sk]) ).

cnf(hi162,axiom,
    ifeq(m1(X0,X1,X2),true,ifeq(k1(X3),true,ifeq(k2(X3,X1),true,k2(X2,X1),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c164]) ).

cnf(h285,plain,
    k2(c,e) = true,
    inference(hyper_resolution,[status(thm)],[hi162,h77,h6,h132]) ).

cnf(f231,axiom,
    ( ~ k2(G,F)
    | k3(F,F,G) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_194) ).

fof(f231_nnf,plain,
    ! [F,G] :
      ( ~ k2(G,F)
      | k3(F,F,G) ),
    inference(nnf_transformation,[status(thm)],[f231]) ).

fof(f231_sk,plain,
    ! [F,G] :
      ( ~ k2(G,F)
      | k3(F,F,G) ),
    inference(skolemisation,[status(esa)],[f231_nnf]) ).

cnf(c231,plain,
    ( ~ k2(X1,X0)
    | k3(X0,X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f231_sk]) ).

cnf(hi228,axiom,
    ifeq(k2(X0,X1),true,k3(X1,X1,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c231]) ).

cnf(h559,plain,
    k3(e,e,c) = true,
    inference(hyper_resolution,[status(thm)],[hi228,h285]) ).

cnf(f324,axiom,
    ( ~ k3(B,B,C)
    | p4(B,C,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_287) ).

fof(f324_nnf,plain,
    ! [B,C] :
      ( ~ k3(B,B,C)
      | p4(B,C,B) ),
    inference(nnf_transformation,[status(thm)],[f324]) ).

fof(f324_sk,plain,
    ! [B,C] :
      ( ~ k3(B,B,C)
      | p4(B,C,B) ),
    inference(skolemisation,[status(esa)],[f324_nnf]) ).

cnf(c324,plain,
    ( ~ k3(X0,X0,X1)
    | p4(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f324_sk]) ).

cnf(hi317,axiom,
    ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c324]) ).

cnf(t71,plain,
    p4(e,c,e) = true,
    inference(hyper_resolution,[status(thm)],[hi317,h559]) ).

cnf(t88,plain,
    p4(e,c,e) = true,
    inference(orient,[status(thm)],[t71]) ).

cnf(f368,negated_conjecture,
    ~ p4(e,c,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ p4(e,c,e),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ p4(e,c,e),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ p4(e,c,e),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

cnf(goal_0,negated_conjecture,
    p4(e,c,e) != true,
    inference(equality_encoding,[status(esa)],[c368]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN273-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 00:41:42 UTC 2026
% 0.03/0.36  % CPUTime  : 
% 0.03/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.47/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.47/1.49  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------