TSTP Solution File: CSR032+1 by ET---2.0

View Problem - Process Solution

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

% Computer : n009.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:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(query32,conjecture,
    ? [X17] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X17) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query32) ).

fof(just57,axiom,
    ! [X10] :
      ( individual(X10)
     => isa(X10,c_individual) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just57) ).

fof(just1,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just1) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X17] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X17) ),
    inference(assume_negation,[status(cth)],[query32]) ).

fof(c_0_4,plain,
    ! [X11] :
      ( ~ individual(X11)
      | isa(X11,c_individual) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just57])]) ).

fof(c_0_5,negated_conjecture,
    ! [X18] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X18) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

cnf(c_0_6,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(split_conjunct,[status(thm)],[just1]) ).

cnf(c_0_8,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 03:09:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.016 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 10
% 0.23/1.42  # Proof object clause steps            : 4
% 0.23/1.42  # Proof object formula steps           : 6
% 0.23/1.42  # Proof object conjectures             : 4
% 0.23/1.42  # Proof object clause conjectures      : 1
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 3
% 0.23/1.42  # Proof object initial formulas used   : 3
% 0.23/1.42  # Proof object generating inferences   : 1
% 0.23/1.42  # Proof object simplifying inferences  : 1
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 68
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 46
% 0.23/1.42  # Initial clauses                      : 23
% 0.23/1.42  # Removed in clause preprocessing      : 0
% 0.23/1.42  # Initial clauses in saturation        : 23
% 0.23/1.42  # Processed clauses                    : 16
% 0.23/1.42  # ...of these trivial                  : 0
% 0.23/1.42  # ...subsumed                          : 0
% 0.23/1.42  # ...remaining for further processing  : 16
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 0
% 0.23/1.42  # Generated clauses                    : 6
% 0.23/1.42  # ...of the previous two non-trivial   : 3
% 0.23/1.42  # Contextual simplify-reflections      : 0
% 0.23/1.42  # Paramodulations                      : 6
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.42  # Current number of processed clauses  : 16
% 0.23/1.42  #    Positive orientable unit clauses  : 7
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 1
% 0.23/1.42  #    Non-unit-clauses                  : 8
% 0.23/1.42  # Current number of unprocessed clauses: 10
% 0.23/1.42  # ...number of literals in the above   : 24
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 0
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 1
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 1
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.42  # Unit Clause-clause subsumption calls : 0
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 0
% 0.23/1.42  # BW rewrite match successes           : 0
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 1424
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.014 s
% 0.23/1.42  # System time              : 0.003 s
% 0.23/1.42  # Total time               : 0.016 s
% 0.23/1.42  # Maximum resident set size: 2784 pages
%------------------------------------------------------------------------------