TSTP Solution File: CSR051+3 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : CSR051+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n020.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 : Fri May  3 02:11:28 EDT 2024

% Result   : Theorem 14.00s 2.67s
% Output   : CNFRefutation 14.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   7 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   32 (  15   ~;   9   |;   1   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   12 (   2 sgn   6   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f395,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_395) ).

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

fof(f7374,axiom,
    ! [X14] :
      ( marriagelicensedocument(X14)
     => isa(X14,c_marriagelicensedocument) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_7374) ).

fof(f8006,conjecture,
    ? [X14] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X14) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151) ).

fof(f8007,negated_conjecture,
    ~ ? [X14] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X14) ),
    inference(negated_conjecture,[],[f8006]) ).

fof(f11097,plain,
    ! [X0] :
      ( marriagelicensedocument(X0)
     => isa(X0,c_marriagelicensedocument) ),
    inference(rectify,[],[f7374]) ).

fof(f11726,plain,
    ~ ? [X0] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X0) ),
    inference(rectify,[],[f8007]) ).

fof(f12585,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(ennf_transformation,[],[f395]) ).

fof(f13714,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(ennf_transformation,[],[f3147]) ).

fof(f16634,plain,
    ! [X0] :
      ( isa(X0,c_marriagelicensedocument)
      | ~ marriagelicensedocument(X0) ),
    inference(ennf_transformation,[],[f11097]) ).

fof(f17119,plain,
    ! [X0] :
      ( ~ marriagelicensedocument(X0)
      & mtvisible(c_tptp_member3356_mt) ),
    inference(ennf_transformation,[],[f11726]) ).

fof(f17507,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(cnf_transformation,[],[f12585]) ).

fof(f20213,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(cnf_transformation,[],[f13714]) ).

fof(f23929,plain,
    ! [X0] :
      ( isa(X0,c_marriagelicensedocument)
      | ~ marriagelicensedocument(X0) ),
    inference(cnf_transformation,[],[f16634]) ).

fof(f24406,plain,
    mtvisible(c_tptp_member3356_mt),
    inference(cnf_transformation,[],[f17119]) ).

fof(f24407,plain,
    ! [X0] : ~ marriagelicensedocument(X0),
    inference(cnf_transformation,[],[f17119]) ).

cnf(c_436,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(cnf_transformation,[],[f17507]) ).

cnf(c_3142,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(cnf_transformation,[],[f20213]) ).

cnf(c_6858,plain,
    ( ~ marriagelicensedocument(X0)
    | isa(X0,c_marriagelicensedocument) ),
    inference(cnf_transformation,[],[f23929]) ).

cnf(c_7335,negated_conjecture,
    ~ marriagelicensedocument(X0),
    inference(cnf_transformation,[],[f24407]) ).

cnf(c_7336,negated_conjecture,
    mtvisible(c_tptp_member3356_mt),
    inference(cnf_transformation,[],[f24406]) ).

cnf(c_10808,plain,
    marriagelicensedocument(c_tptpmarriagelicensedocument),
    inference(global_subsumption_just,[status(thm)],[c_436,c_7336,c_3142]) ).

cnf(c_10810,plain,
    ~ marriagelicensedocument(X0),
    inference(global_subsumption_just,[status(thm)],[c_6858,c_7335]) ).

cnf(c_32887,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_10808,c_10810]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR051+3 : TPTP v8.1.2. Released v3.4.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 22:58:16 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.00/2.67  % SZS status Started for theBenchmark.p
% 14.00/2.67  % SZS status Theorem for theBenchmark.p
% 14.00/2.67  
% 14.00/2.67  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 14.00/2.67  
% 14.00/2.67  ------  iProver source info
% 14.00/2.67  
% 14.00/2.67  git: date: 2024-05-02 19:28:25 +0000
% 14.00/2.67  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 14.00/2.67  git: non_committed_changes: false
% 14.00/2.67  
% 14.00/2.67  ------ Parsing...
% 14.00/2.67  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 14.00/2.67  
% 14.00/2.67  ------ Preprocessing...
% 14.00/2.67  
% 14.00/2.67  % SZS status Theorem for theBenchmark.p
% 14.00/2.67  
% 14.00/2.67  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.00/2.67  
% 14.00/2.67  
%------------------------------------------------------------------------------