↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n008.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 01:52:58 PM UTC 2026

% Result   : Unsatisfiable 4.15s 0.98s
% Output   : Proof 4.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   74 (  50 unt;   0 def)
%            Number of atoms       :  109 (  45 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   67 (  32   ~;  21   |;   7   &)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   54 (   3 sgn  22   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X] :
      ( ! [Y] :
          ( rr(X,Y)
         => cc(Y) )
     => cd(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(f6_nnf,plain,
    ! [X] :
      ( cd(X)
      | ? [Y] :
          ( ~ cc(Y)
          & rr(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X] :
      ( cd(X)
      | ( ~ cc(sk0(X))
        & rr(X,sk0(X)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f6_nnf]) ).

cnf(c9,plain,
    ( cd(X0)
    | ~ cc(sk0(X0)) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(t18,plain,
    ifeq(cc(sk0(X1)),true,cd(X1),true) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t26,plain,
    ifeq(cc(sk0(X1)),true,cd(X1),true) = true,
    inference(orient,[status(thm)],[t18]) ).

fof(f4,axiom,
    ! [X] :
      ( cc(X)
     => ! [Y] :
          ( rr(X,Y)
         => cc(Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f4_nnf,plain,
    ! [X] :
      ( ! [Y] :
          ( cc(Y)
          | ~ rr(X,Y) )
      | ~ cc(X) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X,Y] :
      ( cc(Y)
      | ~ rr(X,Y)
      | ~ cc(X) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c6,plain,
    ( cc(X1)
    | ~ rr(X0,X1)
    | ~ cc(X0) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t21,plain,
    ifeq(cc(X1),true,ifeq(rr(X1,X2),true,cc(X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t25,plain,
    ifeq(cc(X1),true,ifeq(rr(X1,X2),true,cc(X2),true),true) = true,
    inference(orient,[status(thm)],[t21]) ).

cnf(c8,plain,
    ( cd(X0)
    | rr(X0,sk0(X0)) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(t17,plain,
    or(rr(X1,sk0(X1)),cd(X1)) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t36,plain,
    or(rr(X1,sk0(X1)),cd(X1)) = true,
    inference(orient,[status(thm)],[t17]) ).

cnf(t13,plain,
    ifeq(not(X1),true,X1,false) = false,
    introduced(definition) ).

cnf(t46,plain,
    ifeq(not(X1),true,X1,false) = false,
    inference(orient,[status(thm)],[t13]) ).

fof(f3,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
     => ~ cd(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f3_nnf,plain,
    ! [X] :
      ( ~ cd(X)
      | ~ cUnsatisfiable(X) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X] :
      ( ~ cd(X)
      | ~ cUnsatisfiable(X) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c5,plain,
    ( ~ cd(X0)
    | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(t15,plain,
    or(not(cUnsatisfiable(X1)),not(cd(X1))) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t33,plain,
    or(not(cUnsatisfiable(X1)),not(cd(X1))) = true,
    inference(orient,[status(thm)],[t15]) ).

fof(f5,axiom,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f5_nnf,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    inference(nnf_transformation,[status(thm)],[f5]) ).

cnf(c7,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    inference(cnf_transformation,[status(esa)],[f5_nnf]) ).

cnf(t0,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t42,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(t43,plain,
    true = or(not(true),not(cd(i2003_11_14_17_18_23845))),
    inference(cp,[status(thm)],[t33,t42]) ).

cnf(t5,plain,
    not(true) = false,
    introduced(definition) ).

cnf(t47,plain,
    not(true) = false,
    inference(orient,[status(thm)],[t5]) ).

cnf(t78,plain,
    true = or(false,not(cd(i2003_11_14_17_18_23845))),
    inference(step,[status(thm)],[t43,t47]) ).

cnf(t8,plain,
    or(false,X1) = X1,
    introduced(definition) ).

cnf(t24,plain,
    or(false,X1) = X1,
    inference(orient,[status(thm)],[t8]) ).

cnf(t79,plain,
    true = not(cd(i2003_11_14_17_18_23845)),
    inference(step,[status(thm)],[t78,t24]) ).

cnf(t53,plain,
    not(cd(i2003_11_14_17_18_23845)) = true,
    inference(orient,[status(thm)],[t79]) ).

cnf(t54,plain,
    false = ifeq(true,true,cd(i2003_11_14_17_18_23845),false),
    inference(cp,[status(thm)],[t46,t53]) ).

cnf(t10,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t22,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t10]) ).

cnf(t80,plain,
    false = cd(i2003_11_14_17_18_23845),
    inference(step,[status(thm)],[t54,t22]) ).

cnf(t55,plain,
    cd(i2003_11_14_17_18_23845) = false,
    inference(orient,[status(thm)],[t80]) ).

cnf(t56,plain,
    true = or(rr(i2003_11_14_17_18_23845,sk0(i2003_11_14_17_18_23845)),false),
    inference(cp,[status(thm)],[t36,t55]) ).

cnf(t6,plain,
    or(X1,false) = X1,
    introduced(definition) ).

cnf(t23,plain,
    or(X1,false) = X1,
    inference(orient,[status(thm)],[t6]) ).

cnf(t81,plain,
    true = rr(i2003_11_14_17_18_23845,sk0(i2003_11_14_17_18_23845)),
    inference(step,[status(thm)],[t56,t23]) ).

cnf(t58,plain,
    rr(i2003_11_14_17_18_23845,sk0(i2003_11_14_17_18_23845)) = true,
    inference(orient,[status(thm)],[t81]) ).

cnf(t59,plain,
    true = ifeq(cc(i2003_11_14_17_18_23845),true,ifeq(true,true,cc(sk0(i2003_11_14_17_18_23845)),true),true),
    inference(cp,[status(thm)],[t25,t58]) ).

fof(f2,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
     => cc(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f2_nnf,plain,
    ! [X] :
      ( cc(X)
      | ~ cUnsatisfiable(X) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] :
      ( cc(X)
      | ~ cUnsatisfiable(X) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c4,plain,
    ( cc(X0)
    | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi1,axiom,
    ifeq(cUnsatisfiable(X0),true,cc(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(hi3,axiom,
    cUnsatisfiable(i2003_11_14_17_18_23845) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t1,plain,
    cc(i2003_11_14_17_18_23845) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi3]) ).

cnf(t38,plain,
    cc(i2003_11_14_17_18_23845) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(t82,plain,
    true = ifeq(true,true,ifeq(true,true,cc(sk0(i2003_11_14_17_18_23845)),true),true),
    inference(step,[status(thm)],[t59,t38]) ).

cnf(t83,plain,
    true = ifeq(true,true,cc(sk0(i2003_11_14_17_18_23845)),true),
    inference(step,[status(thm)],[t82,t22]) ).

cnf(t84,plain,
    true = cc(sk0(i2003_11_14_17_18_23845)),
    inference(step,[status(thm)],[t83,t22]) ).

cnf(t60,plain,
    cc(sk0(i2003_11_14_17_18_23845)) = true,
    inference(orient,[status(thm)],[t84]) ).

cnf(t64,plain,
    true = ifeq(true,true,cd(i2003_11_14_17_18_23845),true),
    inference(cp,[status(thm)],[t26,t60]) ).

cnf(t85,plain,
    true = cd(i2003_11_14_17_18_23845),
    inference(step,[status(thm)],[t64,t22]) ).

cnf(t86,plain,
    true = false,
    inference(step,[status(thm)],[t85,t55]) ).

cnf(t65,plain,
    false = true,
    inference(orient,[status(thm)],[t86]) ).

fof(f0,axiom,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).

fof(f0_nnf,plain,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c1,plain,
    ~ cowlNothing(X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f1,axiom,
    ! [X] :
      ( xsd_string(X)
    <=> ~ xsd_integer(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).

fof(f1_nnf,plain,
    ! [X] :
      ( ( xsd_integer(X)
        | xsd_string(X) )
      & ( ~ xsd_integer(X)
        | ~ xsd_string(X) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X] :
      ( ( xsd_integer(X)
        | xsd_string(X) )
      & ( ~ xsd_integer(X)
        | ~ xsd_string(X) ) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c2,plain,
    ( ~ xsd_integer(X0)
    | ~ xsd_string(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c1,c2,c5]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS068+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35  % Computer : n008.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Wed Sep 23 19:19:23 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.15/0.98  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.15/0.98  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------