↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 3.91s 0.94s
% Output   : Proof 3.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   44 (  32 unt;   0 def)
%            Number of atoms       :   68 (  13 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   54 (  30   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-4 aty)
%            Number of variables   :   62 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f22,negated_conjecture,
    ( ~ p5(X25,X27)
    | ~ p2(X26,X28)
    | p2(f6(X25,X26),f6(X27,X28)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_23) ).

fof(f22_nnf,plain,
    ! [X25,X26,X27,X28] :
      ( ~ p5(X25,X27)
      | ~ p2(X26,X28)
      | p2(f6(X25,X26),f6(X27,X28)) ),
    inference(nnf_transformation,[status(thm)],[f22]) ).

fof(f22_sk,plain,
    ! [X25,X26,X27,X28] :
      ( ~ p5(X25,X27)
      | ~ p2(X26,X28)
      | p2(f6(X25,X26),f6(X27,X28)) ),
    inference(skolemisation,[status(esa)],[f22_nnf]) ).

cnf(c22,plain,
    ( ~ p5(X0,X2)
    | ~ p2(X1,X3)
    | p2(f6(X0,X1),f6(X2,X3)) ),
    inference(cnf_transformation,[status(esa)],[f22_sk]) ).

cnf(hi21,negated_conjecture,
    ifeq(p2(X0,X1),true,ifeq(p5(X2,X3),true,p2(f6(X2,X0),f6(X3,X1)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c22]) ).

cnf(f3,negated_conjecture,
    p2(c13,c18),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

fof(f3_nnf,plain,
    p2(c13,c18),
    inference(nnf_transformation,[status(thm)],[f3]) ).

cnf(c3,plain,
    p2(c13,c18),
    inference(cnf_transformation,[status(esa)],[f3_nnf]) ).

cnf(hi3,negated_conjecture,
    p2(c13,c18) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(f2,negated_conjecture,
    p5(X31,X31),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_3) ).

fof(f2_nnf,plain,
    ! [X31] : p5(X31,X31),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X31] : p5(X31,X31),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    p5(X0,X0),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

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

cnf(h6,plain,
    p2(f6(V0,c13),f6(V0,c18)) = true,
    inference(hyper_resolution,[status(thm)],[hi21,hi3,hi2]) ).

cnf(f13,negated_conjecture,
    ( ~ p2(X23,X24)
    | p2(f4(X23),f4(X24)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_14) ).

fof(f13_nnf,plain,
    ! [X23,X24] :
      ( ~ p2(X23,X24)
      | p2(f4(X23),f4(X24)) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [X23,X24] :
      ( ~ p2(X23,X24)
      | p2(f4(X23),f4(X24)) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    ( ~ p2(X0,X1)
    | p2(f4(X0),f4(X1)) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(hi12,negated_conjecture,
    ifeq(p2(X0,X1),true,p2(f4(X0),f4(X1)),true) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(h57,plain,
    p2(f4(f6(V0,c13)),f4(f6(V0,c18))) = true,
    inference(hyper_resolution,[status(thm)],[hi12,h6]) ).

cnf(f20,negated_conjecture,
    ( ~ p11(X9,X10)
    | ~ p2(X10,X8)
    | ~ p2(X9,X7)
    | p11(X7,X8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_21) ).

fof(f20_nnf,plain,
    ! [X7,X8,X9,X10] :
      ( ~ p11(X9,X10)
      | ~ p2(X10,X8)
      | ~ p2(X9,X7)
      | p11(X7,X8) ),
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    ! [X7,X8,X9,X10] :
      ( ~ p11(X9,X10)
      | ~ p2(X10,X8)
      | ~ p2(X9,X7)
      | p11(X7,X8) ),
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

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

cnf(hi19,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)],[c20]) ).

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

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

fof(f1_sk,plain,
    ! [X18] : p2(X18,X18),
    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(f6,negated_conjecture,
    p11(f4(f6(c15,c13)),c16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_7) ).

fof(f6_nnf,plain,
    p11(f4(f6(c15,c13)),c16),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    p11(f4(f6(c15,c13)),c16),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(hi6,negated_conjecture,
    p11(f4(f6(c15,c13)),c16) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t65,plain,
    p11(f4(f6(c15,c18)),c16) = true,
    inference(hyper_resolution,[status(thm)],[hi19,h57,hi1,hi6]) ).

cnf(t336,plain,
    p11(f4(f6(c15,c18)),c16) = true,
    inference(orient,[status(thm)],[t65]) ).

cnf(f8,negated_conjecture,
    ~ p11(f4(f6(c15,c18)),c16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_9) ).

fof(f8_nnf,plain,
    ~ p11(f4(f6(c15,c18)),c16),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ~ p11(f4(f6(c15,c18)),c16),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ~ p11(f4(f6(c15,c18)),c16),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(goal_0,negated_conjecture,
    p11(f4(f6(c15,c18)),c16) != true,
    inference(equality_encoding,[status(esa)],[c8]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN583-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n004.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.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Fri Sep 25 01:48:12 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.91/0.94  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.91/0.94  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------