↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET835-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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:04 PM UTC 2026

% Result   : Unsatisfiable 5.41s 1.26s
% Output   : Proof 5.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (  18 unt;   0 def)
%            Number of atoms       :   30 (   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    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( c_in(V_c,V_B,T_a)
    | ~ c_lessequals(V_A,V_B,tc_set(T_a))
    | ~ c_in(V_c,V_A,T_a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).

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

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

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

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

cnf(f2,negated_conjecture,
    c_in(v_x,v_Y,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f2_nnf,plain,
    c_in(v_x,v_Y,t_a),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    c_in(v_x,v_Y,t_a),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,negated_conjecture,
    c_in(v_x,v_Y,t_a) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(f1,negated_conjecture,
    c_lessequals(v_Y,v_X,tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

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

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

cnf(t0,plain,
    c_in(v_x,v_X,t_a) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,hi1]) ).

cnf(t7,plain,
    c_in(v_x,v_X,t_a) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(f3,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f3_nnf,plain,
    ~ c_in(v_x,v_X,t_a),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ~ c_in(v_x,v_X,t_a),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ~ c_in(v_x,v_X,t_a),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    c_in(v_x,v_X,t_a) != true,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET835-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n016.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 : Thu Sep 24 12:13:13 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.41/1.26  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.41/1.26  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------