↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n016.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:08 PM UTC 2026

% Result   : Unsatisfiable 11.32s 7.08s
% Output   : Proof 11.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   39 (  27 unt;   0 def)
%            Number of atoms       :   59 (  12 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  26   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   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   :   37 (   4 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f66,axiom,
    ( ~ s0(H)
    | ~ p0(H,I)
    | m1(H,I,H) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_029) ).

fof(f66_nnf,plain,
    ! [H,I] :
      ( ~ s0(H)
      | ~ p0(H,I)
      | m1(H,I,H) ),
    inference(nnf_transformation,[status(thm)],[f66]) ).

fof(f66_sk,plain,
    ! [H,I] :
      ( ~ s0(H)
      | ~ p0(H,I)
      | m1(H,I,H) ),
    inference(skolemisation,[status(esa)],[f66_nnf]) ).

cnf(c66,plain,
    ( ~ s0(X0)
    | ~ p0(X0,X1)
    | m1(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f66_sk]) ).

cnf(hi66,axiom,
    ifeq(p0(X0,X1),true,ifeq(s0(X0),true,m1(X0,X1,X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c66]) ).

cnf(f13,axiom,
    p0(b,X),
    file('/export/starexec/sandbox/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(f4,axiom,
    s0(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f4_nnf,plain,
    s0(b),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    s0(b),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    s0(b) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(h34,plain,
    m1(b,V0,b) = true,
    inference(hyper_resolution,[status(thm)],[hi66,hi13,hi4]) ).

cnf(f213,axiom,
    ( ~ m1(E,D,E)
    | p2(D,E,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_176) ).

fof(f213_nnf,plain,
    ! [D,E] :
      ( ~ m1(E,D,E)
      | p2(D,E,D) ),
    inference(nnf_transformation,[status(thm)],[f213]) ).

fof(f213_sk,plain,
    ! [D,E] :
      ( ~ m1(E,D,E)
      | p2(D,E,D) ),
    inference(skolemisation,[status(esa)],[f213_nnf]) ).

cnf(c213,plain,
    ( ~ m1(X1,X0,X1)
    | p2(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f213_sk]) ).

cnf(hi210,axiom,
    ifeq(m1(X0,X1,X0),true,p2(X1,X0,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c213]) ).

cnf(h184,plain,
    p2(V0,b,V0) = true,
    inference(hyper_resolution,[status(thm)],[hi210,h34]) ).

cnf(f252,axiom,
    ( ~ p2(G,H,G)
    | ~ r0(G)
    | l3(G,H) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_215) ).

fof(f252_nnf,plain,
    ! [G,H] :
      ( ~ p2(G,H,G)
      | ~ r0(G)
      | l3(G,H) ),
    inference(nnf_transformation,[status(thm)],[f252]) ).

fof(f252_sk,plain,
    ! [G,H] :
      ( ~ p2(G,H,G)
      | ~ r0(G)
      | l3(G,H) ),
    inference(skolemisation,[status(esa)],[f252_nnf]) ).

cnf(c252,plain,
    ( ~ p2(X0,X1,X0)
    | ~ r0(X0)
    | l3(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f252_sk]) ).

cnf(hi247,axiom,
    ifeq(r0(X0),true,ifeq(p2(X0,X1,X0),true,l3(X0,X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c252]) ).

cnf(f12,axiom,
    r0(e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).

fof(f12_nnf,plain,
    r0(e),
    inference(nnf_transformation,[status(thm)],[f12]) ).

cnf(c12,plain,
    r0(e),
    inference(cnf_transformation,[status(esa)],[f12_nnf]) ).

cnf(hi12,axiom,
    r0(e) = true,
    inference(equality_encoding,[status(esa)],[c12]) ).

cnf(t68,plain,
    l3(e,b) = true,
    inference(hyper_resolution,[status(thm)],[hi247,hi12,h184]) ).

cnf(t300,plain,
    l3(e,b) = true,
    inference(orient,[status(thm)],[t68]) ).

cnf(f368,negated_conjecture,
    ~ l3(e,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN235-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.36  % Computer : n016.cluster.edu
% 0.10/5.36  % Model    : x86_64 x86_64
% 0.10/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36  % Memory   : 8046.5625MB
% 0.10/5.36  % OS       : Linux 6.8.0-71-generic
% 0.10/5.36  % CPULimit : 300
% 0.10/5.36  % WCLimit  : 300
% 0.10/5.36  % DateTime : Fri Sep 25 00:40:05 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.32/7.08  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.32/7.08  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------