↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% 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 : Thu Sep 24 08:25:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax1_51,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('CSR002+1.ax',ax1_51) ).

fof(query101,conjecture,
    ? [X] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X) ),
    file('theBenchmark.p',query101) ).

fof(f_51_1,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(fof_nnf,[status(thm)],[ax1_51]) ).

cnf(f_51_2,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(clausify,[status(thm)],[f_51_1]) ).

fof(f_1132_1,negated_conjecture,
    ~ ? [X] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X) ),
    inference(negate,[status(cth)],[query101]) ).

fof(f_1132_2,negated_conjecture,
    ! [X] :
      ( ~ marriagelicensedocument(X)
      & mtvisible(c_tptp_member3356_mt) ),
    inference(fof_nnf,[status(thm)],[f_1132_1]) ).

fof(f_1132_3,negated_conjecture,
    ! [U_1121] :
      ( ~ marriagelicensedocument(U_1121)
      & mtvisible(c_tptp_member3356_mt) ),
    inference(variable_rename,[status(thm)],[f_1132_2]) ).

fof(f_1132_4,negated_conjecture,
    ( ! [U_1121] : ~ marriagelicensedocument(U_1121)
    & mtvisible(c_tptp_member3356_mt) ),
    inference(miniscope,[status(thm)],[f_1132_3]) ).

fof(f_1132_5,negated_conjecture,
    ( ! [U_1121] : ~ marriagelicensedocument(U_1121)
    & mtvisible(c_tptp_member3356_mt) ),
    inference(definitional_conversion,[status(esa)],[f_1132_4]) ).

cnf(f_1132_6,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    inference(clausify,[status(thm)],[f_1132_5]) ).

cnf(f_1132_7,negated_conjecture,
    ~ marriagelicensedocument(U_1121),
    inference(clausify,[status(thm)],[f_1132_5]) ).

cnf(t1,plain,
    ~ marriagelicensedocument(c_tptpmarriagelicensedocument),
    inference(start,[status(thm),parent(0:0)],[f_1132_7]) ).

cnf(t2,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(extension,[status(thm),parent(t1:1)],[f_51_2]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    mtvisible(c_tptp_member3356_mt),
    inference(extension,[status(thm),parent(t2:2)],[f_1132_6]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n006.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 16:00:42 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 1.56/1.88  % SZS status Theorem for theBenchmark
% 1.56/1.88  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------