↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR032+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n026.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:33 EDT 2022

% Result   : Theorem 12.96s 14.15s
% Output   : CNFRefutation 12.96s
% 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(query182,conjecture,
    ? [X24] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X24) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query182) ).

fof(ax3_44154,axiom,
    ! [X16] :
      ( individual(X16)
     => isa(X16,c_individual) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_44154) ).

fof(ax3_14987,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_14987) ).

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

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

fof(c_0_5,negated_conjecture,
    ! [X25] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X25) ),
    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)],[ax3_14987]) ).

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.07/0.12  % Problem  : CSR032+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n026.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 : Thu Jun  9 18:55:18 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 12.96/14.15  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 12.96/14.15  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 12.96/14.15  # Preprocessing time       : 0.645 s
% 12.96/14.15  
% 12.96/14.15  # Proof found!
% 12.96/14.15  # SZS status Theorem
% 12.96/14.15  # SZS output start CNFRefutation
% See solution above
% 12.96/14.15  # Proof object total steps             : 10
% 12.96/14.15  # Proof object clause steps            : 4
% 12.96/14.15  # Proof object formula steps           : 6
% 12.96/14.15  # Proof object conjectures             : 4
% 12.96/14.15  # Proof object clause conjectures      : 1
% 12.96/14.15  # Proof object formula conjectures     : 3
% 12.96/14.15  # Proof object initial clauses used    : 3
% 12.96/14.15  # Proof object initial formulas used   : 3
% 12.96/14.15  # Proof object generating inferences   : 1
% 12.96/14.15  # Proof object simplifying inferences  : 1
% 12.96/14.15  # Training examples: 0 positive, 0 negative
% 12.96/14.15  # Parsed axioms                        : 44217
% 12.96/14.15  # Removed by relevancy pruning/SinE    : 44127
% 12.96/14.15  # Initial clauses                      : 91
% 12.96/14.15  # Removed in clause preprocessing      : 1
% 12.96/14.15  # Initial clauses in saturation        : 90
% 12.96/14.15  # Processed clauses                    : 36
% 12.96/14.15  # ...of these trivial                  : 4
% 12.96/14.15  # ...subsumed                          : 2
% 12.96/14.15  # ...remaining for further processing  : 30
% 12.96/14.15  # Other redundant clauses eliminated   : 2
% 12.96/14.15  # Clauses deleted for lack of memory   : 0
% 12.96/14.15  # Backward-subsumed                    : 0
% 12.96/14.15  # Backward-rewritten                   : 0
% 12.96/14.15  # Generated clauses                    : 7
% 12.96/14.15  # ...of the previous two non-trivial   : 4
% 12.96/14.15  # Contextual simplify-reflections      : 0
% 12.96/14.15  # Paramodulations                      : 5
% 12.96/14.15  # Factorizations                       : 0
% 12.96/14.15  # Equation resolutions                 : 2
% 12.96/14.15  # Current number of processed clauses  : 28
% 12.96/14.15  #    Positive orientable unit clauses  : 14
% 12.96/14.15  #    Positive unorientable unit clauses: 0
% 12.96/14.15  #    Negative unit clauses             : 2
% 12.96/14.15  #    Non-unit-clauses                  : 12
% 12.96/14.15  # Current number of unprocessed clauses: 58
% 12.96/14.15  # ...number of literals in the above   : 91
% 12.96/14.15  # Current number of archived formulas  : 0
% 12.96/14.15  # Current number of archived clauses   : 0
% 12.96/14.15  # Clause-clause subsumption calls (NU) : 36
% 12.96/14.15  # Rec. Clause-clause subsumption calls : 27
% 12.96/14.15  # Non-unit clause-clause subsumptions  : 2
% 12.96/14.15  # Unit Clause-clause subsumption calls : 11
% 12.96/14.15  # Rewrite failures with RHS unbound    : 0
% 12.96/14.15  # BW rewrite match attempts            : 0
% 12.96/14.15  # BW rewrite match successes           : 0
% 12.96/14.15  # Condensation attempts                : 0
% 12.96/14.15  # Condensation successes               : 0
% 12.96/14.15  # Termbank termtop insertions          : 294927
% 12.96/14.15  
% 12.96/14.15  # -------------------------------------------------
% 12.96/14.15  # User time                : 0.598 s
% 12.96/14.15  # System time              : 0.048 s
% 12.96/14.15  # Total time               : 0.646 s
% 12.96/14.15  # Maximum resident set size: 86984 pages
%------------------------------------------------------------------------------