↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 3.33s 0.90s
% Output   : Proof 3.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  19 unt;   0 def)
%            Number of atoms       :   31 (   7 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   27 (   9 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f129,axiom,
    ( ~ p0(C,J)
    | ~ n0(B,A)
    | q1(J,A,J) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_092) ).

fof(f129_nnf,plain,
    ! [J,A,B,C] :
      ( ~ p0(C,J)
      | ~ n0(B,A)
      | q1(J,A,J) ),
    inference(nnf_transformation,[status(thm)],[f129]) ).

fof(f129_sk,plain,
    ! [J,A,B,C] :
      ( ~ p0(C,J)
      | ~ n0(B,A)
      | q1(J,A,J) ),
    inference(skolemisation,[status(esa)],[f129_nnf]) ).

cnf(c129,plain,
    ( ~ p0(X3,X0)
    | ~ n0(X2,X1)
    | q1(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f129_sk]) ).

cnf(hi127,axiom,
    ifeq(n0(X0,X1),true,ifeq(p0(X2,X3),true,q1(X3,X1,X3),true),true) = true,
    inference(equality_encoding,[status(esa)],[c129]) ).

cnf(f10,axiom,
    n0(e,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).

fof(f10_nnf,plain,
    n0(e,b),
    inference(nnf_transformation,[status(thm)],[f10]) ).

cnf(c10,plain,
    n0(e,b),
    inference(cnf_transformation,[status(esa)],[f10_nnf]) ).

cnf(hi10,axiom,
    n0(e,b) = true,
    inference(equality_encoding,[status(esa)],[c10]) ).

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(t0,plain,
    q1(X1,b,X1) = true,
    inference(hyper_resolution,[status(thm)],[hi127,hi10,hi13]) ).

cnf(t10,plain,
    q1(X1,b,X1) = true,
    inference(orient,[status(thm)],[t0]) ).

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN296-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/0.37  % Computer : n026.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.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 00:48:27 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.33/0.90  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/0.90  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------