↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN166-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 : n009.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:33:58 PM UTC 2026

% Result   : Unsatisfiable 8.83s 1.64s
% Output   : Proof 8.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   45 (  33 unt;   0 def)
%            Number of atoms       :   65 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  26   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   44 (  15 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(f124,axiom,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_087) ).

fof(f124_nnf,plain,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    inference(nnf_transformation,[status(thm)],[f124]) ).

fof(f124_sk,plain,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    inference(skolemisation,[status(esa)],[f124_nnf]) ).

cnf(c124,plain,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    inference(cnf_transformation,[status(esa)],[f124_sk]) ).

cnf(hi122,axiom,
    ifeq(r0(b),true,ifeq(p1(a,a,a),true,p1(a,b,a),true),true) = true,
    inference(equality_encoding,[status(esa)],[c124]) ).

cnf(f8,axiom,
    r0(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

fof(f8_nnf,plain,
    r0(b),
    inference(nnf_transformation,[status(thm)],[f8]) ).

cnf(c8,plain,
    r0(b),
    inference(cnf_transformation,[status(esa)],[f8_nnf]) ).

cnf(hi8,axiom,
    r0(b) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(h175,plain,
    p1(a,b,a) = true,
    inference(hyper_resolution,[status(thm)],[hi122,hi8,h30]) ).

cnf(f119,axiom,
    ( ~ p1(J,H,A)
    | ~ m0(J,H,A)
    | p1(H,I,J) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_082) ).

fof(f119_nnf,plain,
    ! [H,I,J,A] :
      ( ~ p1(J,H,A)
      | ~ m0(J,H,A)
      | p1(H,I,J) ),
    inference(nnf_transformation,[status(thm)],[f119]) ).

fof(f119_sk,plain,
    ! [H,I,J,A] :
      ( ~ p1(J,H,A)
      | ~ m0(J,H,A)
      | p1(H,I,J) ),
    inference(skolemisation,[status(esa)],[f119_nnf]) ).

cnf(c119,plain,
    ( ~ p1(X2,X0,X3)
    | ~ m0(X2,X0,X3)
    | p1(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f119_sk]) ).

cnf(hi117,axiom,
    ifeq(m0(X0,X1,X2),true,ifeq(p1(X0,X1,X2),true,p1(X1,X3,X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c119]) ).

cnf(f11,axiom,
    m0(a,X,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).

fof(f11_nnf,plain,
    ! [X] : m0(a,X,a),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [X] : m0(a,X,a),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    m0(a,X0,a),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(hi11,axiom,
    m0(a,X0,a) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(h340,plain,
    p1(b,V0,a) = true,
    inference(hyper_resolution,[status(thm)],[hi117,hi11,h175]) ).

cnf(f37,axiom,
    m0(b,a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_38) ).

fof(f37_nnf,plain,
    m0(b,a,a),
    inference(nnf_transformation,[status(thm)],[f37]) ).

cnf(c37,plain,
    m0(b,a,a),
    inference(cnf_transformation,[status(esa)],[f37_nnf]) ).

cnf(hi37,axiom,
    m0(b,a,a) = true,
    inference(equality_encoding,[status(esa)],[c37]) ).

cnf(t66,plain,
    p1(a,X1,b) = true,
    inference(hyper_resolution,[status(thm)],[hi117,hi37,h340]) ).

cnf(t381,plain,
    p1(a,X1,b) = true,
    inference(orient,[status(thm)],[t66]) ).

cnf(f368,negated_conjecture,
    ~ p1(a,b,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

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

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

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