↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV269-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 : n017.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:12:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f2,axiom,
    ( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
    | ~ c_in(V_c,V_B,T_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__iff_2) ).

fof(f2_nnf,plain,
    ! [V_c,V_B,T_a,V_A] :
      ( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
      | ~ c_in(V_c,V_B,T_a) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [V_c,V_B,T_a,V_A] :
      ( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
      | ~ c_in(V_c,V_B,T_a) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( c_in(X0,c_union(X3,X1,X2),X2)
    | ~ c_in(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi1,axiom,
    ifeq(c_in(X0,X1,X2),true,c_in(X0,c_union(X3,X1,X2),X2),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(f0,negated_conjecture,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f0_nnf,plain,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,negated_conjecture,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t2,plain,
    c_in(v_X,c_union(X1,c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0]) ).

cnf(t6,plain,
    c_in(v_X,c_union(X1,c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg) = true,
    inference(orient,[status(thm)],[t2]) ).

cnf(f1,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f1_nnf,plain,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(goal_0,negated_conjecture,
    c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg) != true,
    inference(equality_encoding,[status(esa)],[c1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV269-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n017.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 18:53:01 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.05/0.93  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.05/0.93  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------