%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n028.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 : Tue May  7 10:28:42 EDT 2024

% Result   : Theorem 76.48s 22.33s
% Output   : Refutation 76.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   15 (   3 unt;   4 typ;   0 def)
%            Number of atoms       :   19 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   30 (   6   ~;   2   |;   0   &;  16   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   4 con; 0-1 aty)
%            Number of variables   :    5 (   0   ^   1   !;   4   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mtvisible_type,type,
    mtvisible: $i > $o ).

thf(c_tptp_member3356_mt_type,type,
    c_tptp_member3356_mt: $i ).

thf(marriagelicensedocument_type,type,
    marriagelicensedocument: $i > $o ).

thf(c_tptpmarriagelicensedocument_type,type,
    c_tptpmarriagelicensedocument: $i ).

thf(148,axiom,
    ( ( mtvisible @ c_tptp_member3356_mt )
   => ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_51) ).

thf(443,plain,
    ( ( mtvisible @ c_tptp_member3356_mt )
   => ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[148]) ).

thf(444,plain,
    ( ~ ( mtvisible @ c_tptp_member3356_mt )
    | ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) ),
    inference(cnf,[status(esa)],[443]) ).

thf(1,conjecture,
    ? [A: $i] :
      ( ( mtvisible @ c_tptp_member3356_mt )
     => ( marriagelicensedocument @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query101) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
        ( ( mtvisible @ c_tptp_member3356_mt )
       => ( marriagelicensedocument @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(200,plain,
    ~ ? [A: $i] :
        ( ( mtvisible @ c_tptp_member3356_mt )
       => ( marriagelicensedocument @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(201,plain,
    ~ ( ( mtvisible @ c_tptp_member3356_mt )
     => ? [A: $i] : ( marriagelicensedocument @ A ) ),
    inference(miniscope,[status(thm)],[200]) ).

thf(202,plain,
    ! [A: $i] :
      ~ ( marriagelicensedocument @ A ),
    inference(cnf,[status(esa)],[201]) ).

thf(203,plain,
    mtvisible @ c_tptp_member3356_mt,
    inference(cnf,[status(esa)],[201]) ).

thf(14220,plain,
    ( ~ $true
    | $false ),
    inference(rewrite,[status(thm)],[444,202,203]) ).

thf(14221,plain,
    $false,
    inference(simp,[status(thm)],[14220]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% 0.06/0.13  % Command  : run_Leo-III %s %d
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon May  6 23:28:09 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.94/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.72/1.08  % [INFO] 	 Parsing done (250ms). 
% 1.88/1.09  % [INFO] 	 Running in sequential loop mode. 
% 2.33/1.30  % [INFO] 	 nitpick registered as external prover. 
% 2.33/1.31  % [INFO] 	 Scanning for conjecture ... 
% 2.60/1.41  % [INFO] 	 Found a conjecture and 1131 axioms. Running axiom selection ... 
% 3.40/1.56  % [INFO] 	 Axiom selection finished. Selected 197 axioms (removed 934 axioms). 
% 3.72/1.65  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.72/1.65  % [INFO] 	 Type checking passed. 
% 3.72/1.66  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 76.48/22.33  % [INFO] 	 Killing All external provers ... 
% 76.48/22.33  % Time passed: 21823ms (effective reasoning time: 21233ms)
% 76.48/22.33  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 76.48/22.33  % Axioms used in derivation (1): ax1_51
% 76.48/22.33  % No. of inferences in proof: 11
% 76.48/22.33  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 21823 ms resp. 21233 ms w/o parsing
% 76.48/22.35  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 76.48/22.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------