↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET855-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 : n016.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 02:44:09 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( V_A = V_B
    | ~ c_lessequals(V_A,V_B,tc_set(T_a))
    | ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

fof(f0_nnf,plain,
    ! [V_B,V_A,T_a] :
      ( V_A = V_B
      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
      | ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [V_B,V_A,T_a] :
      ( V_A = V_B
      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
      | ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( X1 = X0
    | ~ c_lessequals(X1,X0,tc_set(X2))
    | ~ c_lessequals(X0,X1,tc_set(X2)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(c_lessequals(X0,X1,tc_set(X2)),true,ifeq(c_lessequals(X1,X0,tc_set(X2)),true,X1,X0),X0) = X0,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(f1,negated_conjecture,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f1_nnf,plain,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(nnf_transformation,[status(thm)],[f1]) ).

cnf(c1,plain,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(cnf_transformation,[status(esa)],[f1_nnf]) ).

cnf(hi1,negated_conjecture,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f2,negated_conjecture,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f2_nnf,plain,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,negated_conjecture,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t0,plain,
    c_Union(v_Y,tc_set(t_a)) = v_n,
    inference(hyper_resolution,[status(thm)],[hi0,hi1,hi2]) ).

cnf(t13,plain,
    c_Union(v_Y,tc_set(t_a)) = v_n,
    inference(orient,[status(thm)],[t0]) ).

cnf(f3,negated_conjecture,
    v_n != c_Union(v_Y,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f3_nnf,plain,
    v_n != c_Union(v_Y,tc_set(t_a)),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    v_n != c_Union(v_Y,tc_set(t_a)),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    v_n != c_Union(v_Y,tc_set(t_a)),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    c_Union(v_Y,tc_set(t_a)) != v_n,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET855-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n016.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 : Thu Sep 24 12:20:00 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.37/1.17  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.37/1.17  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------