↑ Up

FindProof---0.1.UNS-Prf.s

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

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

% Result   : Unsatisfiable 6.00s 6.31s
% Output   : Proof 6.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   46 (  26 unt;   0 def)
%            Number of atoms       :   66 (  17 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   46 (  26   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    2 (   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   :   68 (  22 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f361,axiom,
    ( ~ l4(I)
    | q5(I,I) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_324) ).

fof(f361_nnf,plain,
    ! [I] :
      ( ~ l4(I)
      | q5(I,I) ),
    inference(nnf_transformation,[status(thm)],[f361]) ).

fof(f361_sk,plain,
    ! [I] :
      ( ~ l4(I)
      | q5(I,I) ),
    inference(skolemisation,[status(esa)],[f361_nnf]) ).

cnf(c361,plain,
    ( ~ l4(X0)
    | q5(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f361_sk]) ).

cnf(u80,axiom,
    ifeq(l4(X0),true,q5(X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c361]) ).

cnf(f122,axiom,
    ( ~ p0(C,B)
    | p1(B,B,B) ),
    file('/export/starexec/sandbox2/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(f13,axiom,
    p0(b,X),
    file('/export/starexec/sandbox2/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(h30,plain,
    p1(V0,V0,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi120,hi13]) ).

cnf(f174,axiom,
    ( ~ p1(B,C,A)
    | n2(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).

fof(f174_nnf,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(nnf_transformation,[status(thm)],[f174]) ).

fof(f174_sk,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(skolemisation,[status(esa)],[f174_nnf]) ).

cnf(c174,plain,
    ( ~ p1(X1,X2,X0)
    | n2(X0) ),
    inference(cnf_transformation,[status(esa)],[f174_sk]) ).

cnf(hi171,axiom,
    ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
    inference(equality_encoding,[status(esa)],[c174]) ).

cnf(h174,plain,
    n2(V0) = true,
    inference(hyper_resolution,[status(thm)],[hi171,h30]) ).

cnf(f281,axiom,
    ( ~ n2(H)
    | p3(H,H,H) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_244) ).

fof(f281_nnf,plain,
    ! [H] :
      ( ~ n2(H)
      | p3(H,H,H) ),
    inference(nnf_transformation,[status(thm)],[f281]) ).

fof(f281_sk,plain,
    ! [H] :
      ( ~ n2(H)
      | p3(H,H,H) ),
    inference(skolemisation,[status(esa)],[f281_nnf]) ).

cnf(c281,plain,
    ( ~ n2(X0)
    | p3(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f281_sk]) ).

cnf(hi276,axiom,
    ifeq(n2(X0),true,p3(X0,X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c281]) ).

cnf(h218,plain,
    p3(V0,V0,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi276,h174]) ).

cnf(f314,axiom,
    ( ~ p3(A,B,J)
    | l4(J) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_277) ).

fof(f314_nnf,plain,
    ! [J,A,B] :
      ( ~ p3(A,B,J)
      | l4(J) ),
    inference(nnf_transformation,[status(thm)],[f314]) ).

fof(f314_sk,plain,
    ! [J,A,B] :
      ( ~ p3(A,B,J)
      | l4(J) ),
    inference(skolemisation,[status(esa)],[f314_nnf]) ).

cnf(c314,plain,
    ( ~ p3(X1,X2,X0)
    | l4(X0) ),
    inference(cnf_transformation,[status(esa)],[f314_sk]) ).

cnf(hi308,axiom,
    ifeq(p3(X0,X1,X2),true,l4(X2),true) = true,
    inference(equality_encoding,[status(esa)],[c314]) ).

cnf(d5,axiom,
    l4(V0) = true,
    inference(hyper_resolution,[status(thm)],[hi308,h218]) ).

cnf(t159,plain,
    ifeq(true,true,q5(X1,X1),true) = true,
    inference(definition_unfolding,[status(thm)],[u80,d5]) ).

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

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

cnf(t266,plain,
    q5(X1,X1) = true,
    inference(step,[status(thm)],[t159,t246]) ).

cnf(t256,plain,
    q5(X1,X1) = true,
    inference(orient,[status(thm)],[t266]) ).

cnf(f368,negated_conjecture,
    ~ q5(e,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ q5(e,e),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ q5(e,e),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ q5(e,e),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

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

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

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

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