↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n015.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:35:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
    ( ~ r(A,B)
    | q(A,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lx1_2) ).

fof(f1_nnf,plain,
    ! [A,B] :
      ( ~ r(A,B)
      | q(A,A) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A,B] :
      ( ~ r(A,B)
      | q(A,A) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ r(X0,X1)
    | q(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,negated_conjecture,
    ifeq(r(X0,X1),true,q(X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f0,negated_conjecture,
    r(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lx1_1) ).

fof(f0_nnf,plain,
    r(a,b),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    r(a,b),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,negated_conjecture,
    r(a,b) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(h0,plain,
    q(a,a) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0]) ).

cnf(f2,negated_conjecture,
    ( ~ q(A,B)
    | r(C,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lx1_3) ).

fof(f2_nnf,plain,
    ! [C,B,A] :
      ( ~ q(A,B)
      | r(C,B) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [C,B,A] :
      ( ~ q(A,B)
      | r(C,B) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ q(X2,X1)
    | r(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,negated_conjecture,
    ifeq(q(X0,X1),true,r(X2,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h1,plain,
    r(V0,a) = true,
    inference(hyper_resolution,[status(thm)],[hi2,h0]) ).

cnf(f3,negated_conjecture,
    ( ~ r(b,A)
    | ~ q(A,a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lx1_4) ).

fof(f3_nnf,plain,
    ! [A] :
      ( ~ r(b,A)
      | ~ q(A,a) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A] :
      ( ~ r(b,A)
      | ~ q(A,a) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ r(b,X0)
    | ~ q(X0,a) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,negated_conjecture,
    ifeq(q(X0,a),true,ifeq(r(b,X0),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi3,h0,h1]) ).

cnf(t22,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN721-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n015.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 02:14:12 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.86/1.26  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.86/1.26  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------