↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : PUZ063-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 : n005.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:32:01 PM UTC 2026

% Result   : Unsatisfiable 5.20s 6.15s
% Output   : Proof 5.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  11 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    7 (   7   ~;   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    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   12 (   4 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f2,axiom,
    c_union(c_emptyset,V_y,T_a) = V_y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__empty__left_0) ).

fof(f2_nnf,plain,
    ! [V_y,T_a] : c_union(c_emptyset,V_y,T_a) = V_y,
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [V_y,T_a] : c_union(c_emptyset,V_y,T_a) = V_y,
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    c_union(c_emptyset,X0,X1) = X0,
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(t0,plain,
    c_union(c_emptyset,X1,X2) = X1,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t2,plain,
    c_union(c_emptyset,X1,X2) = X1,
    inference(orient,[status(thm)],[t0]) ).

cnf(f0,negated_conjecture,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f0_nnf,plain,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(t1,plain,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t3,plain,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(f1,negated_conjecture,
    ~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f1_nnf,plain,
    ~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(goal_0,negated_conjecture,
    c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) != true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(g0_0,plain,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) != true,
    inference(rw,[status(thm)],[goal_0,t2]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ063-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/5.37  % Computer : n005.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Thu Sep 24 06:52:26 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.20/6.15  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.20/6.15  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------