↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 6.67s 1.31s
% Output   : Proof 6.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   78 (  50 unt;   0 def)
%            Number of atoms       :  138 (  24 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  126 (  66   ~;  60   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :  109 (  30 sgn  42   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f162,axiom,
    ( ~ p0(I,I)
    | s1(I) ),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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(f16,axiom,
    q0(X,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).

fof(f16_nnf,plain,
    ! [X] : q0(X,d),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [X] : q0(X,d),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c16,plain,
    q0(X0,d),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(hi16,axiom,
    q0(X0,d) = true,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(h117,plain,
    s1(V0) = true,
    inference(hyper_resolution,[status(thm)],[hi161,hi16,h26]) ).

cnf(f32,axiom,
    q0(d,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_33) ).

fof(f32_nnf,plain,
    q0(d,c),
    inference(nnf_transformation,[status(thm)],[f32]) ).

cnf(c32,plain,
    q0(d,c),
    inference(cnf_transformation,[status(esa)],[f32_nnf]) ).

cnf(hi32,axiom,
    q0(d,c) = true,
    inference(equality_encoding,[status(esa)],[c32]) ).

cnf(h116,plain,
    s1(d) = true,
    inference(hyper_resolution,[status(thm)],[hi161,hi32,h26]) ).

cnf(f170,axiom,
    ( ~ m0(C,B,J)
    | ~ s1(B)
    | ~ p0(A,A)
    | l2(J,J) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_133) ).

fof(f170_nnf,plain,
    ! [J,A,B,C] :
      ( ~ m0(C,B,J)
      | ~ s1(B)
      | ~ p0(A,A)
      | l2(J,J) ),
    inference(nnf_transformation,[status(thm)],[f170]) ).

fof(f170_sk,plain,
    ! [J,A,B,C] :
      ( ~ m0(C,B,J)
      | ~ s1(B)
      | ~ p0(A,A)
      | l2(J,J) ),
    inference(skolemisation,[status(esa)],[f170_nnf]) ).

cnf(c170,plain,
    ( ~ m0(X3,X2,X0)
    | ~ s1(X2)
    | ~ p0(X1,X1)
    | l2(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f170_sk]) ).

cnf(hi167,axiom,
    ifeq(p0(X0,X0),true,ifeq(s1(X1),true,ifeq(m0(X2,X1,X3),true,l2(X3,X3),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c170]) ).

cnf(f18,axiom,
    m0(X,d,Y),
    file('/export/starexec/sandbox/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(h165,plain,
    l2(V0,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi167,hi13,h116,hi18]) ).

cnf(f38,axiom,
    ( ~ n0(J,I)
    | k1(I) ),
    file('/export/starexec/sandbox/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(f6,axiom,
    n0(d,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(f6_nnf,plain,
    n0(d,b),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    n0(d,b),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(hi6,axiom,
    n0(d,b) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(h14,plain,
    k1(b) = true,
    inference(hyper_resolution,[status(thm)],[hi38,hi6]) ).

cnf(f220,axiom,
    ( ~ l2(E,D)
    | ~ l0(c)
    | ~ k1(E)
    | q2(D,c,E) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_183) ).

fof(f220_nnf,plain,
    ! [D,E] :
      ( ~ l2(E,D)
      | ~ l0(c)
      | ~ k1(E)
      | q2(D,c,E) ),
    inference(nnf_transformation,[status(thm)],[f220]) ).

fof(f220_sk,plain,
    ! [D,E] :
      ( ~ l2(E,D)
      | ~ l0(c)
      | ~ k1(E)
      | q2(D,c,E) ),
    inference(skolemisation,[status(esa)],[f220_nnf]) ).

cnf(c220,plain,
    ( ~ l2(X1,X0)
    | ~ l0(c)
    | ~ k1(X1)
    | q2(X0,c,X1) ),
    inference(cnf_transformation,[status(esa)],[f220_sk]) ).

cnf(hi217,axiom,
    ifeq(k1(X0),true,ifeq(l0(c),true,ifeq(l2(X0,X1),true,q2(X1,c,X0),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c220]) ).

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(h317,plain,
    q2(b,c,b) = true,
    inference(hyper_resolution,[status(thm)],[hi217,h14,hi23,h165]) ).

cnf(f226,axiom,
    ( ~ s1(b)
    | ~ q2(b,H,b)
    | s2(H) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_189) ).

fof(f226_nnf,plain,
    ! [H] :
      ( ~ s1(b)
      | ~ q2(b,H,b)
      | s2(H) ),
    inference(nnf_transformation,[status(thm)],[f226]) ).

fof(f226_sk,plain,
    ! [H] :
      ( ~ s1(b)
      | ~ q2(b,H,b)
      | s2(H) ),
    inference(skolemisation,[status(esa)],[f226_nnf]) ).

cnf(c226,plain,
    ( ~ s1(b)
    | ~ q2(b,X0,b)
    | s2(X0) ),
    inference(cnf_transformation,[status(esa)],[f226_sk]) ).

cnf(hi223,axiom,
    ifeq(q2(b,X0,b),true,ifeq(s1(b),true,s2(X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c226]) ).

cnf(h623,plain,
    s2(c) = true,
    inference(hyper_resolution,[status(thm)],[hi223,h317,h117]) ).

cnf(f310,axiom,
    ( ~ m0(A,B,J)
    | ~ s2(I)
    | ~ q2(A,I,A)
    | s3(I,J) ),
    file('/export/starexec/sandbox/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(t45,plain,
    s3(c,X1) = true,
    inference(hyper_resolution,[status(thm)],[hi305,h317,h623,hi18]) ).

cnf(t69,plain,
    s3(c,X1) = true,
    inference(orient,[status(thm)],[t45]) ).

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

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

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

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

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

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

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

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