↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN571-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/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:35:13 PM UTC 2026

% Result   : Unsatisfiable 3.85s 0.94s
% Output   : Proof 3.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   53 (  37 unt;   0 def)
%            Number of atoms       :   81 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   66 (  38   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-4 aty)
%            Number of variables   :   91 (  10 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f11,negated_conjecture,
    ( ~ p2(X11,X13)
    | ~ p2(X11,X12)
    | p2(X12,X13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).

fof(f11_nnf,plain,
    ! [X12,X13,X11] :
      ( ~ p2(X11,X13)
      | ~ p2(X11,X12)
      | p2(X12,X13) ),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [X12,X13,X11] :
      ( ~ p2(X11,X13)
      | ~ p2(X11,X12)
      | p2(X12,X13) ),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    ( ~ p2(X2,X1)
    | ~ p2(X2,X0)
    | p2(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(hi9,negated_conjecture,
    ifeq(p2(X0,X1),true,ifeq(p2(X0,X2),true,p2(X1,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(f13,negated_conjecture,
    p2(f9(f5(X24),f5(X25)),f5(f8(X24,X25))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_14) ).

fof(f13_nnf,plain,
    ! [X24,X25] : p2(f9(f5(X24),f5(X25)),f5(f8(X24,X25))),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [X24,X25] : p2(f9(f5(X24),f5(X25)),f5(f8(X24,X25))),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    p2(f9(f5(X0),f5(X1)),f5(f8(X0,X1))),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(hi11,negated_conjecture,
    p2(f9(f5(X0),f5(X1)),f5(f8(X0,X1))) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(f1,negated_conjecture,
    p2(X11,X11),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_2) ).

fof(f1_nnf,plain,
    ! [X11] : p2(X11,X11),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X11] : p2(X11,X11),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    p2(X0,X0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,negated_conjecture,
    p2(X0,X0) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(h1,plain,
    p2(f5(f8(V0,V1)),f9(f5(V0),f5(V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi9,hi11,hi1]) ).

cnf(f16,negated_conjecture,
    ( ~ p11(X2,X3)
    | ~ p2(X3,X1)
    | ~ p2(X2,X0)
    | p11(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_17) ).

fof(f16_nnf,plain,
    ! [X0,X1,X2,X3] :
      ( ~ p11(X2,X3)
      | ~ p2(X3,X1)
      | ~ p2(X2,X0)
      | p11(X0,X1) ),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [X0,X1,X2,X3] :
      ( ~ p11(X2,X3)
      | ~ p2(X3,X1)
      | ~ p2(X2,X0)
      | p11(X0,X1) ),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c16,plain,
    ( ~ p11(X2,X3)
    | ~ p2(X3,X1)
    | ~ p2(X2,X0)
    | p11(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(hi14,negated_conjecture,
    ifeq(p2(X0,X1),true,ifeq(p2(X2,X3),true,ifeq(p11(X0,X2),true,p11(X1,X3),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(f2,negated_conjecture,
    p11(f5(X10),c14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_3) ).

fof(f2_nnf,plain,
    ! [X10] : p11(f5(X10),c14),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X10] : p11(f5(X10),c14),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    p11(f5(X0),c14),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,negated_conjecture,
    p11(f5(X0),c14) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h3,plain,
    p11(f9(f5(V0),f5(V1)),c14) = true,
    inference(hyper_resolution,[status(thm)],[hi14,h1,hi1,hi2]) ).

cnf(f14,negated_conjecture,
    ( ~ p11(f9(X6,X8),X7)
    | p11(X6,f3(X7,X8)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_15) ).

fof(f14_nnf,plain,
    ! [X6,X7,X8] :
      ( ~ p11(f9(X6,X8),X7)
      | p11(X6,f3(X7,X8)) ),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [X6,X7,X8] :
      ( ~ p11(f9(X6,X8),X7)
      | p11(X6,f3(X7,X8)) ),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c14,plain,
    ( ~ p11(f9(X0,X2),X1)
    | p11(X0,f3(X1,X2)) ),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(hi12,negated_conjecture,
    ifeq(p11(f9(X0,X1),X2),true,p11(X0,f3(X2,X1)),true) = true,
    inference(equality_encoding,[status(esa)],[c14]) ).

cnf(h5,plain,
    p11(f5(V0),f3(c14,f5(V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi12,h3]) ).

cnf(f6,negated_conjecture,
    ( ~ p11(f5(f10(X9)),X9)
    | p11(c14,X9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_7) ).

fof(f6_nnf,plain,
    ! [X9] :
      ( ~ p11(f5(f10(X9)),X9)
      | p11(c14,X9) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X9] :
      ( ~ p11(f5(f10(X9)),X9)
      | p11(c14,X9) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ p11(f5(f10(X0)),X0)
    | p11(c14,X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(hi4,negated_conjecture,
    ifeq(p11(f5(f10(X0)),X0),true,p11(c14,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(h7,plain,
    p11(c14,f3(c14,f5(V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi4,h5]) ).

cnf(f5,negated_conjecture,
    ~ p11(X39,f3(X39,f5(f6(f7(c12))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_6) ).

fof(f5_nnf,plain,
    ! [X39] : ~ p11(X39,f3(X39,f5(f6(f7(c12))))),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X39] : ~ p11(X39,f3(X39,f5(f6(f7(c12))))),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ~ p11(X0,f3(X0,f5(f6(f7(c12))))),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(hi19,negated_conjecture,
    ifeq(p11(X0,f3(X0,f5(f6(f7(c12))))),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi19,h7]) ).

cnf(t144,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(f3,negated_conjecture,
    ~ p11(c13,f5(X40)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_4) ).

fof(f3_nnf,plain,
    ! [X40] : ~ p11(c13,f5(X40)),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X40] : ~ p11(c13,f5(X40)),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ~ p11(c13,f5(X0)),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN571-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 01:46:28 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.85/0.94  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.85/0.94  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------