↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n014.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:33:56 PM UTC 2026

% Result   : Unsatisfiable 7.44s 6.53s
% Output   : Proof 7.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   45 (  33 unt;   0 def)
%            Number of atoms       :   73 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   62 (  34   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   35 (   3 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f9,axiom,
    p0(b,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).

fof(f9_nnf,plain,
    p0(b,d),
    inference(nnf_transformation,[status(thm)],[f9]) ).

cnf(c9,plain,
    p0(b,d),
    inference(cnf_transformation,[status(esa)],[f9_nnf]) ).

cnf(hi9,axiom,
    p0(b,d) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(h2,plain,
    p0(b,d) = true,
    inference(hyper_resolution,[status(thm)],[hi9]) ).

cnf(f23,axiom,
    l0(c),
    file('/export/starexec/sandbox/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(h1,plain,
    l0(c) = true,
    inference(hyper_resolution,[status(thm)],[hi23]) ).

cnf(f4,axiom,
    s0(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f4_nnf,plain,
    s0(b),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    s0(b),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    s0(b) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(h0,plain,
    s0(b) = true,
    inference(hyper_resolution,[status(thm)],[hi4]) ).

cnf(f87,axiom,
    ( ~ p0(b,E)
    | ~ l0(D)
    | ~ s0(b)
    | n1(D,E,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_050) ).

fof(f87_nnf,plain,
    ! [D,E] :
      ( ~ p0(b,E)
      | ~ l0(D)
      | ~ s0(b)
      | n1(D,E,D) ),
    inference(nnf_transformation,[status(thm)],[f87]) ).

fof(f87_sk,plain,
    ! [D,E] :
      ( ~ p0(b,E)
      | ~ l0(D)
      | ~ s0(b)
      | n1(D,E,D) ),
    inference(skolemisation,[status(esa)],[f87_nnf]) ).

cnf(c87,plain,
    ( ~ p0(b,X1)
    | ~ l0(X0)
    | ~ s0(b)
    | n1(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f87_sk]) ).

cnf(hi86,axiom,
    ifeq(s0(b),true,ifeq(l0(X0),true,ifeq(p0(b,X1),true,n1(X0,X1,X0),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c87]) ).

cnf(h3,plain,
    n1(c,d,c) = true,
    inference(hyper_resolution,[status(thm)],[hi86,h0,h1,h2]) ).

cnf(f39,axiom,
    ( ~ n0(H,G)
    | l1(G,G) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).

fof(f39_nnf,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(nnf_transformation,[status(thm)],[f39]) ).

fof(f39_sk,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(skolemisation,[status(esa)],[f39_nnf]) ).

cnf(c39,plain,
    ( ~ n0(X1,X0)
    | l1(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f39_sk]) ).

cnf(hi39,axiom,
    ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c39]) ).

cnf(f25,axiom,
    n0(d,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_26) ).

fof(f25_nnf,plain,
    n0(d,c),
    inference(nnf_transformation,[status(thm)],[f25]) ).

cnf(c25,plain,
    n0(d,c),
    inference(cnf_transformation,[status(esa)],[f25_nnf]) ).

cnf(hi25,axiom,
    n0(d,c) = true,
    inference(equality_encoding,[status(esa)],[c25]) ).

cnf(h4,plain,
    l1(c,c) = true,
    inference(hyper_resolution,[status(thm)],[hi39,hi25]) ).

cnf(f91,axiom,
    ( ~ n1(E,F,E)
    | ~ l1(G,E)
    | ~ l0(G)
    | n1(E,F,F) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_054) ).

fof(f91_nnf,plain,
    ! [E,F,G] :
      ( ~ n1(E,F,E)
      | ~ l1(G,E)
      | ~ l0(G)
      | n1(E,F,F) ),
    inference(nnf_transformation,[status(thm)],[f91]) ).

fof(f91_sk,plain,
    ! [E,F,G] :
      ( ~ n1(E,F,E)
      | ~ l1(G,E)
      | ~ l0(G)
      | n1(E,F,F) ),
    inference(skolemisation,[status(esa)],[f91_nnf]) ).

cnf(c91,plain,
    ( ~ n1(X0,X1,X0)
    | ~ l1(X2,X0)
    | ~ l0(X2)
    | n1(X0,X1,X1) ),
    inference(cnf_transformation,[status(esa)],[f91_sk]) ).

cnf(hi90,axiom,
    ifeq(l0(X0),true,ifeq(l1(X0,X1),true,ifeq(n1(X1,X2,X1),true,n1(X1,X2,X2),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c91]) ).

cnf(t5,plain,
    n1(c,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi90,h1,h4,h3]) ).

cnf(t62,plain,
    n1(c,d,d) = true,
    inference(orient,[status(thm)],[t5]) ).

cnf(f368,negated_conjecture,
    ~ n1(c,d,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

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

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

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