↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 6.82s 6.44s
% Output   : Proof 6.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   60 (  36 unt;   0 def)
%            Number of atoms       :  100 (  19 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  :   12 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-4 aty)
%            Number of variables   :   80 (  21 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f40,axiom,
    ( ~ m0(D,C,E)
    | ~ r0(F)
    | ~ p0(E,C)
    | l1(C,D) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_003) ).

fof(f40_nnf,plain,
    ! [C,D,E,F] :
      ( ~ m0(D,C,E)
      | ~ r0(F)
      | ~ p0(E,C)
      | l1(C,D) ),
    inference(nnf_transformation,[status(thm)],[f40]) ).

fof(f40_sk,plain,
    ! [C,D,E,F] :
      ( ~ m0(D,C,E)
      | ~ r0(F)
      | ~ p0(E,C)
      | l1(C,D) ),
    inference(skolemisation,[status(esa)],[f40_nnf]) ).

cnf(c40,plain,
    ( ~ m0(X1,X0,X2)
    | ~ r0(X3)
    | ~ p0(X2,X0)
    | l1(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f40_sk]) ).

cnf(hi40,axiom,
    ifeq(p0(X0,X1),true,ifeq(r0(X2),true,ifeq(m0(X3,X1,X0),true,l1(X1,X3),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c40]) ).

cnf(f17,axiom,
    p0(c,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18) ).

fof(f17_nnf,plain,
    p0(c,b),
    inference(nnf_transformation,[status(thm)],[f17]) ).

cnf(c17,plain,
    p0(c,b),
    inference(cnf_transformation,[status(esa)],[f17_nnf]) ).

cnf(hi17,axiom,
    p0(c,b) = true,
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(f12,axiom,
    r0(e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13) ).

fof(f12_nnf,plain,
    r0(e),
    inference(nnf_transformation,[status(thm)],[f12]) ).

cnf(c12,plain,
    r0(e),
    inference(cnf_transformation,[status(esa)],[f12_nnf]) ).

cnf(hi12,axiom,
    r0(e) = true,
    inference(equality_encoding,[status(esa)],[c12]) ).

cnf(f26,axiom,
    m0(e,b,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_27) ).

fof(f26_nnf,plain,
    m0(e,b,c),
    inference(nnf_transformation,[status(thm)],[f26]) ).

cnf(c26,plain,
    m0(e,b,c),
    inference(cnf_transformation,[status(esa)],[f26_nnf]) ).

cnf(hi26,axiom,
    m0(e,b,c) = true,
    inference(equality_encoding,[status(esa)],[c26]) ).

cnf(h87,plain,
    l1(b,e) = true,
    inference(hyper_resolution,[status(thm)],[hi40,hi17,hi12,hi26]) ).

cnf(f103,axiom,
    ( ~ n0(H,G)
    | p1(G,G,G) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_066) ).

fof(f103_nnf,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | p1(G,G,G) ),
    inference(nnf_transformation,[status(thm)],[f103]) ).

fof(f103_sk,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | p1(G,G,G) ),
    inference(skolemisation,[status(esa)],[f103_nnf]) ).

cnf(c103,plain,
    ( ~ n0(X1,X0)
    | p1(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f103_sk]) ).

cnf(hi102,axiom,
    ifeq(n0(X0,X1),true,p1(X1,X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c103]) ).

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(h4,plain,
    p1(e,e,e) = true,
    inference(hyper_resolution,[status(thm)],[hi102,hi2]) ).

cnf(f174,axiom,
    ( ~ p1(B,C,A)
    | n2(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).

fof(f174_nnf,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(nnf_transformation,[status(thm)],[f174]) ).

fof(f174_sk,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(skolemisation,[status(esa)],[f174_nnf]) ).

cnf(c174,plain,
    ( ~ p1(X1,X2,X0)
    | n2(X0) ),
    inference(cnf_transformation,[status(esa)],[f174_sk]) ).

cnf(hi171,axiom,
    ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
    inference(equality_encoding,[status(esa)],[c174]) ).

cnf(h137,plain,
    n2(e) = true,
    inference(hyper_resolution,[status(thm)],[hi171,h4]) ).

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(f286,axiom,
    ( ~ n2(H)
    | ~ k1(H)
    | p3(H,H,H) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_249) ).

fof(f286_nnf,plain,
    ! [H] :
      ( ~ n2(H)
      | ~ k1(H)
      | p3(H,H,H) ),
    inference(nnf_transformation,[status(thm)],[f286]) ).

fof(f286_sk,plain,
    ! [H] :
      ( ~ n2(H)
      | ~ k1(H)
      | p3(H,H,H) ),
    inference(skolemisation,[status(esa)],[f286_nnf]) ).

cnf(c286,plain,
    ( ~ n2(X0)
    | ~ k1(X0)
    | p3(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f286_sk]) ).

cnf(hi281,axiom,
    ifeq(k1(X0),true,ifeq(n2(X0),true,p3(X0,X0,X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c286]) ).

cnf(h195,plain,
    p3(e,e,e) = true,
    inference(hyper_resolution,[status(thm)],[hi281,h6,h137]) ).

cnf(f336,axiom,
    ( ~ l1(A,C)
    | ~ p3(B,C,D)
    | s4(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_299) ).

fof(f336_nnf,plain,
    ! [A,B,C,D] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(nnf_transformation,[status(thm)],[f336]) ).

fof(f336_sk,plain,
    ! [A,B,C,D] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(skolemisation,[status(esa)],[f336_nnf]) ).

cnf(c336,plain,
    ( ~ l1(X0,X2)
    | ~ p3(X1,X2,X3)
    | s4(X0) ),
    inference(cnf_transformation,[status(esa)],[f336_sk]) ).

cnf(hi329,axiom,
    ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true,
    inference(equality_encoding,[status(esa)],[c336]) ).

cnf(t23,plain,
    s4(b) = true,
    inference(hyper_resolution,[status(thm)],[hi329,h195,h87]) ).

cnf(t56,plain,
    s4(b) = true,
    inference(orient,[status(thm)],[t23]) ).

cnf(f368,negated_conjecture,
    ~ s4(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ s4(b),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ s4(b),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ s4(b),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

cnf(goal_0,negated_conjecture,
    s4(b) != true,
    inference(equality_encoding,[status(esa)],[c368]) ).

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

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

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