↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 6.44s 6.37s
% Output   : Proof 6.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   48 (  28 unt;   0 def)
%            Number of atoms       :   76 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   62 (  34   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   53 (  16 sgn  20   !;   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(h34,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(h51,plain,
    s1(V0) = true,
    inference(hyper_resolution,[status(thm)],[hi161,hi16,h34]) ).

cnf(f122,axiom,
    ( ~ p0(C,B)
    | p1(B,B,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).

fof(f122_nnf,plain,
    ! [B,C] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(nnf_transformation,[status(thm)],[f122]) ).

fof(f122_sk,plain,
    ! [B,C] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(skolemisation,[status(esa)],[f122_nnf]) ).

cnf(c122,plain,
    ( ~ p0(X1,X0)
    | p1(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f122_sk]) ).

cnf(hi120,axiom,
    ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c122]) ).

cnf(h41,plain,
    p1(V0,V0,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi120,hi13]) ).

cnf(f218,axiom,
    ( ~ p1(I,I,I)
    | q2(I,I,I) ),
    file('/export/starexec/sandbox/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(h187,plain,
    q2(V0,V0,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi215,h41]) ).

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(t7,plain,
    s2(b) = true,
    inference(hyper_resolution,[status(thm)],[hi223,h187,h51]) ).

cnf(t668,plain,
    s2(b) = true,
    inference(orient,[status(thm)],[t7]) ).

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

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

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

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

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

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

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

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