TSTP Solution File: CSR051+2 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR051+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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  : 600s
% DateTime : Fri Jul 15 03:01:51 EDT 2022

% Result   : Theorem 0.28s 1.46s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   3 unt;   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 predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    4 (   1 sgn   1   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query101,conjecture,
    ? [X13] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X13) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query101) ).

fof(ax1_51,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_51) ).

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

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

fof(c_0_4,negated_conjecture,
    ! [X14] :
      ( mtvisible(c_tptp_member3356_mt)
      & ~ marriagelicensedocument(X14) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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.07/0.12  % Problem  : CSR051+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 11 09:10:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.28/1.46  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46  # Preprocessing time       : 0.033 s
% 0.28/1.46  
% 0.28/1.46  # Failure: Out of unprocessed clauses!
% 0.28/1.46  # OLD status GaveUp
% 0.28/1.46  # Parsed axioms                        : 1132
% 0.28/1.46  # Removed by relevancy pruning/SinE    : 1129
% 0.28/1.46  # Initial clauses                      : 4
% 0.28/1.46  # Removed in clause preprocessing      : 0
% 0.28/1.46  # Initial clauses in saturation        : 4
% 0.28/1.46  # Processed clauses                    : 4
% 0.28/1.46  # ...of these trivial                  : 0
% 0.28/1.46  # ...subsumed                          : 0
% 0.28/1.46  # ...remaining for further processing  : 4
% 0.28/1.46  # Other redundant clauses eliminated   : 0
% 0.28/1.46  # Clauses deleted for lack of memory   : 0
% 0.28/1.46  # Backward-subsumed                    : 0
% 0.28/1.46  # Backward-rewritten                   : 0
% 0.28/1.46  # Generated clauses                    : 0
% 0.28/1.46  # ...of the previous two non-trivial   : 0
% 0.28/1.46  # Contextual simplify-reflections      : 0
% 0.28/1.46  # Paramodulations                      : 0
% 0.28/1.46  # Factorizations                       : 0
% 0.28/1.46  # Equation resolutions                 : 0
% 0.28/1.46  # Current number of processed clauses  : 4
% 0.28/1.46  #    Positive orientable unit clauses  : 1
% 0.28/1.46  #    Positive unorientable unit clauses: 0
% 0.28/1.46  #    Negative unit clauses             : 1
% 0.28/1.46  #    Non-unit-clauses                  : 2
% 0.28/1.46  # Current number of unprocessed clauses: 0
% 0.28/1.46  # ...number of literals in the above   : 0
% 0.28/1.46  # Current number of archived formulas  : 0
% 0.28/1.46  # Current number of archived clauses   : 0
% 0.28/1.46  # Clause-clause subsumption calls (NU) : 0
% 0.28/1.46  # Rec. Clause-clause subsumption calls : 0
% 0.28/1.46  # Non-unit clause-clause subsumptions  : 0
% 0.28/1.46  # Unit Clause-clause subsumption calls : 0
% 0.28/1.46  # Rewrite failures with RHS unbound    : 0
% 0.28/1.46  # BW rewrite match attempts            : 0
% 0.28/1.46  # BW rewrite match successes           : 0
% 0.28/1.46  # Condensation attempts                : 0
% 0.28/1.46  # Condensation successes               : 0
% 0.28/1.46  # Termbank termtop insertions          : 7433
% 0.28/1.46  
% 0.28/1.46  # -------------------------------------------------
% 0.28/1.46  # User time                : 0.029 s
% 0.28/1.46  # System time              : 0.004 s
% 0.28/1.46  # Total time               : 0.033 s
% 0.28/1.46  # Maximum resident set size: 4856 pages
% 0.28/1.46  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.28/1.46  # Preprocessing time       : 0.044 s
% 0.28/1.46  
% 0.28/1.46  # Proof found!
% 0.28/1.46  # SZS status Theorem
% 0.28/1.46  # SZS output start CNFRefutation
% See solution above
% 0.28/1.46  # Proof object total steps             : 9
% 0.28/1.46  # Proof object clause steps            : 4
% 0.28/1.46  # Proof object formula steps           : 5
% 0.28/1.46  # Proof object conjectures             : 5
% 0.28/1.46  # Proof object clause conjectures      : 2
% 0.28/1.46  # Proof object formula conjectures     : 3
% 0.28/1.46  # Proof object initial clauses used    : 3
% 0.28/1.46  # Proof object initial formulas used   : 2
% 0.28/1.46  # Proof object generating inferences   : 0
% 0.28/1.46  # Proof object simplifying inferences  : 3
% 0.28/1.46  # Training examples: 0 positive, 0 negative
% 0.28/1.46  # Parsed axioms                        : 1132
% 0.28/1.46  # Removed by relevancy pruning/SinE    : 0
% 0.28/1.46  # Initial clauses                      : 1133
% 0.28/1.46  # Removed in clause preprocessing      : 0
% 0.28/1.46  # Initial clauses in saturation        : 1133
% 0.28/1.46  # Processed clauses                    : 35
% 0.28/1.46  # ...of these trivial                  : 0
% 0.28/1.46  # ...subsumed                          : 1
% 0.28/1.46  # ...remaining for further processing  : 33
% 0.28/1.46  # Other redundant clauses eliminated   : 0
% 0.28/1.46  # Clauses deleted for lack of memory   : 0
% 0.28/1.46  # Backward-subsumed                    : 0
% 0.28/1.46  # Backward-rewritten                   : 0
% 0.28/1.46  # Generated clauses                    : 1
% 0.28/1.46  # ...of the previous two non-trivial   : 1
% 0.28/1.46  # Contextual simplify-reflections      : 0
% 0.28/1.46  # Paramodulations                      : 1
% 0.28/1.46  # Factorizations                       : 0
% 0.28/1.46  # Equation resolutions                 : 0
% 0.28/1.46  # Current number of processed clauses  : 33
% 0.28/1.46  #    Positive orientable unit clauses  : 22
% 0.28/1.46  #    Positive unorientable unit clauses: 0
% 0.28/1.46  #    Negative unit clauses             : 4
% 0.28/1.46  #    Non-unit-clauses                  : 7
% 0.28/1.46  # Current number of unprocessed clauses: 1099
% 0.28/1.46  # ...number of literals in the above   : 1922
% 0.28/1.46  # Current number of archived formulas  : 0
% 0.28/1.46  # Current number of archived clauses   : 0
% 0.28/1.46  # Clause-clause subsumption calls (NU) : 13
% 0.28/1.46  # Rec. Clause-clause subsumption calls : 13
% 0.28/1.46  # Non-unit clause-clause subsumptions  : 0
% 0.28/1.46  # Unit Clause-clause subsumption calls : 18
% 0.28/1.46  # Rewrite failures with RHS unbound    : 0
% 0.28/1.46  # BW rewrite match attempts            : 0
% 0.28/1.46  # BW rewrite match successes           : 0
% 0.28/1.46  # Condensation attempts                : 0
% 0.28/1.46  # Condensation successes               : 0
% 0.28/1.46  # Termbank termtop insertions          : 43379
% 0.28/1.46  
% 0.28/1.46  # -------------------------------------------------
% 0.28/1.46  # User time                : 0.042 s
% 0.28/1.46  # System time              : 0.004 s
% 0.28/1.46  # Total time               : 0.046 s
% 0.28/1.46  # Maximum resident set size: 6664 pages
%------------------------------------------------------------------------------