↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 8.37s 1.78s
% Output   : Proof 8.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  20 unt;   0 def)
%            Number of atoms       :   40 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   25 (   9 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f39,axiom,
    ( ~ n0(H,G)
    | l1(G,G) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).

fof(f39_nnf,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(nnf_transformation,[status(thm)],[f39]) ).

fof(f39_sk,plain,
    ! [G,H] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(skolemisation,[status(esa)],[f39_nnf]) ).

cnf(c39,plain,
    ( ~ n0(X1,X0)
    | l1(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f39_sk]) ).

cnf(hi39,axiom,
    ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c39]) ).

cnf(f2,axiom,
    n0(d,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f2_nnf,plain,
    n0(d,e),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    n0(d,e),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,axiom,
    n0(d,e) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h5,plain,
    l1(e,e) = true,
    inference(hyper_resolution,[status(thm)],[hi39,hi2]) ).

cnf(f172,axiom,
    ( ~ l1(G,H)
    | ~ s0(F)
    | m2(F) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_135) ).

fof(f172_nnf,plain,
    ! [F,G,H] :
      ( ~ l1(G,H)
      | ~ s0(F)
      | m2(F) ),
    inference(nnf_transformation,[status(thm)],[f172]) ).

fof(f172_sk,plain,
    ! [F,G,H] :
      ( ~ l1(G,H)
      | ~ s0(F)
      | m2(F) ),
    inference(skolemisation,[status(esa)],[f172_nnf]) ).

cnf(c172,plain,
    ( ~ l1(X1,X2)
    | ~ s0(X0)
    | m2(X0) ),
    inference(cnf_transformation,[status(esa)],[f172_sk]) ).

cnf(hi169,axiom,
    ifeq(s0(X0),true,ifeq(l1(X1,X2),true,m2(X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c172]) ).

cnf(f0,axiom,
    s0(d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).

fof(f0_nnf,plain,
    s0(d),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    s0(d),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    s0(d) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t6,plain,
    m2(d) = true,
    inference(hyper_resolution,[status(thm)],[hi169,hi0,h5]) ).

cnf(t383,plain,
    m2(d) = true,
    inference(orient,[status(thm)],[t6]) ).

cnf(f368,negated_conjecture,
    ~ m2(d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ m2(d),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ m2(d),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ m2(d),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

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

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

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

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