↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN208-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 4.80s 6.12s
% Output   : Proof 4.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   62 (  38 unt;   0 def)
%            Number of atoms       :  106 (  19 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   94 (  50   ~;  44   |;   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   :   72 (  23 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f162,axiom,
    ( ~ p0(I,I)
    | s1(I) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_125) ).

fof(f162_nnf,plain,
    ! [I] :
      ( ~ p0(I,I)
      | s1(I) ),
    inference(nnf_transformation,[status(thm)],[f162]) ).

fof(f162_sk,plain,
    ! [I] :
      ( ~ p0(I,I)
      | s1(I) ),
    inference(skolemisation,[status(esa)],[f162_nnf]) ).

cnf(c162,plain,
    ( ~ p0(X0,X0)
    | s1(X0) ),
    inference(cnf_transformation,[status(esa)],[f162_sk]) ).

cnf(hi160,axiom,
    ifeq(p0(X0,X0),true,s1(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c162]) ).

cnf(f13,axiom,
    p0(b,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

fof(f13_nnf,plain,
    ! [X] : p0(b,X),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [X] : p0(b,X),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    p0(b,X0),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(hi13,axiom,
    p0(b,X0) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(h26,plain,
    s1(b) = true,
    inference(hyper_resolution,[status(thm)],[hi160,hi13]) ).

cnf(f163,axiom,
    ( ~ s1(H)
    | ~ q0(F,G)
    | s1(F) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_126) ).

fof(f163_nnf,plain,
    ! [F,G,H] :
      ( ~ s1(H)
      | ~ q0(F,G)
      | s1(F) ),
    inference(nnf_transformation,[status(thm)],[f163]) ).

fof(f163_sk,plain,
    ! [F,G,H] :
      ( ~ s1(H)
      | ~ q0(F,G)
      | s1(F) ),
    inference(skolemisation,[status(esa)],[f163_nnf]) ).

cnf(c163,plain,
    ( ~ s1(X2)
    | ~ q0(X0,X1)
    | s1(X0) ),
    inference(cnf_transformation,[status(esa)],[f163_sk]) ).

cnf(hi161,axiom,
    ifeq(q0(X0,X1),true,ifeq(s1(X2),true,s1(X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c163]) ).

cnf(f35,axiom,
    q0(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_36) ).

fof(f35_nnf,plain,
    q0(a,b),
    inference(nnf_transformation,[status(thm)],[f35]) ).

cnf(c35,plain,
    q0(a,b),
    inference(cnf_transformation,[status(esa)],[f35_nnf]) ).

cnf(hi35,axiom,
    q0(a,b) = true,
    inference(equality_encoding,[status(esa)],[c35]) ).

cnf(h115,plain,
    s1(a) = true,
    inference(hyper_resolution,[status(thm)],[hi161,hi35,h26]) ).

cnf(f227,axiom,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_190) ).

fof(f227_nnf,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    inference(nnf_transformation,[status(thm)],[f227]) ).

fof(f227_sk,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    inference(skolemisation,[status(esa)],[f227_nnf]) ).

cnf(c227,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    inference(cnf_transformation,[status(esa)],[f227_sk]) ).

cnf(hi224,axiom,
    ifeq(s1(a),true,ifeq(s0(d),true,s2(d),true),true) = true,
    inference(equality_encoding,[status(esa)],[c227]) ).

cnf(f0,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f0_nnf,plain,
    s0(d),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    s0(d),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    s0(d) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(h160,plain,
    s2(d) = true,
    inference(hyper_resolution,[status(thm)],[hi224,h115,hi0]) ).

cnf(f109,axiom,
    ( ~ s0(F)
    | ~ s0(G)
    | p1(F,F,F) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_072) ).

fof(f109_nnf,plain,
    ! [F,G] :
      ( ~ s0(F)
      | ~ s0(G)
      | p1(F,F,F) ),
    inference(nnf_transformation,[status(thm)],[f109]) ).

fof(f109_sk,plain,
    ! [F,G] :
      ( ~ s0(F)
      | ~ s0(G)
      | p1(F,F,F) ),
    inference(skolemisation,[status(esa)],[f109_nnf]) ).

cnf(c109,plain,
    ( ~ s0(X0)
    | ~ s0(X1)
    | p1(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f109_sk]) ).

cnf(hi108,axiom,
    ifeq(s0(X0),true,ifeq(s0(X1),true,p1(X1,X1,X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c109]) ).

cnf(h1,plain,
    p1(d,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi108,hi0,hi0]) ).

cnf(f218,axiom,
    ( ~ p1(I,I,I)
    | q2(I,I,I) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_181) ).

fof(f218_nnf,plain,
    ! [I] :
      ( ~ p1(I,I,I)
      | q2(I,I,I) ),
    inference(nnf_transformation,[status(thm)],[f218]) ).

fof(f218_sk,plain,
    ! [I] :
      ( ~ p1(I,I,I)
      | q2(I,I,I) ),
    inference(skolemisation,[status(esa)],[f218_nnf]) ).

cnf(c218,plain,
    ( ~ p1(X0,X0,X0)
    | q2(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f218_sk]) ).

cnf(hi215,axiom,
    ifeq(p1(X0,X0,X0),true,q2(X0,X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c218]) ).

cnf(h124,plain,
    q2(d,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi215,h1]) ).

cnf(f310,axiom,
    ( ~ m0(A,B,J)
    | ~ s2(I)
    | ~ q2(A,I,A)
    | s3(I,J) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_273) ).

fof(f310_nnf,plain,
    ! [I,J,A,B] :
      ( ~ m0(A,B,J)
      | ~ s2(I)
      | ~ q2(A,I,A)
      | s3(I,J) ),
    inference(nnf_transformation,[status(thm)],[f310]) ).

fof(f310_sk,plain,
    ! [I,J,A,B] :
      ( ~ m0(A,B,J)
      | ~ s2(I)
      | ~ q2(A,I,A)
      | s3(I,J) ),
    inference(skolemisation,[status(esa)],[f310_nnf]) ).

cnf(c310,plain,
    ( ~ m0(X2,X3,X1)
    | ~ s2(X0)
    | ~ q2(X2,X0,X2)
    | s3(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f310_sk]) ).

cnf(hi305,axiom,
    ifeq(q2(X0,X1,X0),true,ifeq(s2(X1),true,ifeq(m0(X0,X2,X3),true,s3(X1,X3),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c310]) ).

cnf(f18,axiom,
    m0(X,d,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).

fof(f18_nnf,plain,
    ! [X,Y] : m0(X,d,Y),
    inference(nnf_transformation,[status(thm)],[f18]) ).

fof(f18_sk,plain,
    ! [X,Y] : m0(X,d,Y),
    inference(skolemisation,[status(esa)],[f18_nnf]) ).

cnf(c18,plain,
    m0(X0,d,X1),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi18,axiom,
    m0(X0,d,X1) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(t14,plain,
    s3(d,X1) = true,
    inference(hyper_resolution,[status(thm)],[hi305,h124,h160,hi18]) ).

cnf(t47,plain,
    s3(d,X1) = true,
    inference(orient,[status(thm)],[t14]) ).

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

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

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

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

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

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

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

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