↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYO632-1 : TPTP v9.3.1. Released v7.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:48:34 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f3,axiom,
    ( ~ qtd3(f(B_0),s(qtd2))
    | ~ qtd3(f(A_0),qtd2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1_04) ).

fof(f3_nnf,plain,
    ! [A_0,B_0] :
      ( ~ qtd3(f(B_0),s(qtd2))
      | ~ qtd3(f(A_0),qtd2) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A_0,B_0] :
      ( ~ qtd3(f(B_0),s(qtd2))
      | ~ qtd3(f(A_0),qtd2) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ qtd3(f(X1),s(qtd2))
    | ~ qtd3(f(X0),qtd2) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi4,axiom,
    ifeq(qtd3(f(X0),qtd2),true,ifeq(qtd3(f(X1),s(qtd2)),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(f1,axiom,
    qtd3(f(qtd1(s(s(qtd2)),K)),qtd2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2_02) ).

fof(f1_nnf,plain,
    ! [K] : qtd3(f(qtd1(s(s(qtd2)),K)),qtd2),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [K] : qtd3(f(qtd1(s(s(qtd2)),K)),qtd2),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    qtd3(f(qtd1(s(s(qtd2)),X0)),qtd2),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    qtd3(f(qtd1(s(s(qtd2)),X0)),qtd2) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f2,axiom,
    qtd3(f(B),s(qtd2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_0_03) ).

fof(f2_nnf,plain,
    ! [B] : qtd3(f(B),s(qtd2)),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [B] : qtd3(f(B),s(qtd2)),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    qtd3(f(X0),s(qtd2)),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    qtd3(f(X0),s(qtd2)) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi4,hi1,hi2]) ).

cnf(t12,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,t12]) ).

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

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