↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n006.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 12:55:11 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,negated_conjecture,
    c_lessequals(c_0,v_h(V_U,V_V),t_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f0_nnf,plain,
    ! [V_U,V_V] : c_lessequals(c_0,v_h(V_U,V_V),t_c),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [V_U,V_V] : c_lessequals(c_0,v_h(V_U,V_V),t_c),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    c_lessequals(c_0,v_h(X0,X1),t_c),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t0,plain,
    c_lessequals(c_0,v_h(X1,X2),t_c) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t1,plain,
    c_lessequals(c_0,v_h(X1,X2),t_c) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(f1,negated_conjecture,
    ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f1_nnf,plain,
    ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ c_lessequals(c_0,v_h(v_xa,v_xb),t_c),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(goal_0,negated_conjecture,
    c_lessequals(c_0,v_h(v_xa,v_xb),t_c) != true,
    inference(equality_encoding,[status(esa)],[c1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA041-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.56  % Computer : n006.cluster.edu
% 0.10/0.56  % Model    : x86_64 x86_64
% 0.10/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56  % Memory   : 8046.5625MB
% 0.10/0.56  % OS       : Linux 6.8.0-71-generic
% 0.10/0.56  % CPULimit : 300
% 0.10/0.56  % WCLimit  : 300
% 0.10/0.56  % DateTime : Fri Sep 25 05:50:41 UTC 2026
% 0.10/0.57  % CPUTime  : 
% 0.10/0.57  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.01/1.21  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.01/1.21  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------