%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 30 19:44:15 EDT 2023

% Result   : Theorem 0.15s 0.49s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   24 (   3 unt;  15 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  11   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    4 (   1 sgn;   1   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    c_tptp_member3356_mt: $i ).

tff(decl_23,type,
    mtvisible: $i > $o ).

tff(decl_24,type,
    c_tptpmarriagelicensedocument: $i ).

tff(decl_25,type,
    marriagelicensedocument: $i > $o ).

tff(decl_26,type,
    isa: ( $i * $i ) > $o ).

tff(decl_27,type,
    disjointwith: ( $i * $i ) > $o ).

tff(decl_28,type,
    genlinverse: ( $i * $i ) > $o ).

tff(decl_29,type,
    genlpreds: ( $i * $i ) > $o ).

tff(decl_30,type,
    predicate: $i > $o ).

tff(decl_31,type,
    binarypredicate: $i > $o ).

tff(decl_32,type,
    collection: $i > $o ).

tff(decl_33,type,
    genls: ( $i * $i ) > $o ).

tff(decl_34,type,
    c_basekb: $i ).

tff(decl_35,type,
    c_marriagelicensedocument: $i ).

tff(decl_36,type,
    thing: $i > $o ).

fof(query51,conjecture,
    ? [X10] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X10) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query51) ).

fof(just1,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X10] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X10) ),
    inference(assume_negation,[status(cth)],[query51]) ).

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

fof(c_0_4,negated_conjecture,
    ! [X69] :
      ( mtvisible(c_tptp_member3356_mt)
      & ~ marriagelicensedocument(X69) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

cnf(c_0_5,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ marriagelicensedocument(X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.10  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.09/0.30  % Computer : n032.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Aug 28 07:26:30 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 0.15/0.47  start to proof: theBenchmark
% 0.15/0.49  % Version  : CSE_E---1.5
% 0.15/0.49  % Problem  : theBenchmark.p
% 0.15/0.49  % Proof found
% 0.15/0.49  % SZS status Theorem for theBenchmark.p
% 0.15/0.49  % SZS output start Proof
% See solution above
% 0.15/0.49  % Total time : 0.004000 s
% 0.15/0.49  % SZS output end Proof
% 0.15/0.49  % Total time : 0.007000 s
%------------------------------------------------------------------------------