↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n011.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:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(query38,conjecture,
    ? [X13] :
      ( mtvisible(c_knowledgefragmentd3mt)
     => ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
        & tptpcol_16_7738(X13) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query38) ).

fof(just41,axiom,
    ! [X13] :
      ( isa(X13,c_tptpcol_16_7738)
     => tptpcol_16_7738(X13) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just41) ).

fof(just6,axiom,
    ! [X1] :
      ( isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
     => tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just6) ).

fof(just1,axiom,
    ! [X1,X2,X3,X4] :
      ( ( isa(X1,X2)
        & relationexistsall(X3,X4,X2) )
     => isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just1) ).

fof(just8,axiom,
    isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just8) ).

fof(just7,axiom,
    relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just7) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X13] :
        ( mtvisible(c_knowledgefragmentd3mt)
       => ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
          & tptpcol_16_7738(X13) ) ),
    inference(assume_negation,[status(cth)],[query38]) ).

fof(c_0_7,negated_conjecture,
    ! [X14] :
      ( mtvisible(c_knowledgefragmentd3mt)
      & ( ~ tptp_8_968(X14,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
        | ~ tptpcol_16_7738(X14) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_8,plain,
    ! [X14] :
      ( ~ isa(X14,c_tptpcol_16_7738)
      | tptpcol_16_7738(X14) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just41])]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ tptpcol_16_7738(X1)
    | ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( tptpcol_16_7738(X1)
    | ~ isa(X1,c_tptpcol_16_7738) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X2] :
      ( ~ isa(X2,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
      | tptp_8_968(f_relationexistsallfn(X2,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just6])]) ).

fof(c_0_12,plain,
    ! [X5,X6,X7,X8] :
      ( ~ isa(X5,X6)
      | ~ relationexistsall(X7,X8,X6)
      | isa(f_relationexistsallfn(X5,X7,X8,X6),X8) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just1])]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
    | ~ isa(X1,c_tptpcol_16_7738) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)
    | ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    inference(split_conjunct,[status(thm)],[just8]) ).

cnf(c_0_16,plain,
    ( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
    | ~ relationexistsall(X2,X3,X4)
    | ~ isa(X1,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    inference(split_conjunct,[status(thm)],[just7]) ).

cnf(c_0_18,negated_conjecture,
    ~ isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_19,plain,
    ( isa(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738)
    | ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR038+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 11 10:26:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.015 s
% 0.23/1.41  
% 0.23/1.41  # Failure: Out of unprocessed clauses!
% 0.23/1.41  # OLD status GaveUp
% 0.23/1.41  # Parsed axioms                        : 73
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 61
% 0.23/1.41  # Initial clauses                      : 13
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 13
% 0.23/1.41  # Processed clauses                    : 15
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 0
% 0.23/1.41  # ...remaining for further processing  : 15
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 7
% 0.23/1.41  # ...of the previous two non-trivial   : 2
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 7
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 15
% 0.23/1.41  #    Positive orientable unit clauses  : 5
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 0
% 0.23/1.41  #    Non-unit-clauses                  : 10
% 0.23/1.41  # Current number of unprocessed clauses: 0
% 0.23/1.41  # ...number of literals in the above   : 0
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 7
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 6
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 0
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 1149
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.011 s
% 0.23/1.41  # System time              : 0.004 s
% 0.23/1.41  # Total time               : 0.015 s
% 0.23/1.41  # Maximum resident set size: 2804 pages
% 0.23/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41  # Preprocessing time       : 0.016 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 21
% 0.23/1.41  # Proof object clause steps            : 10
% 0.23/1.41  # Proof object formula steps           : 11
% 0.23/1.41  # Proof object conjectures             : 7
% 0.23/1.41  # Proof object clause conjectures      : 4
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 6
% 0.23/1.41  # Proof object initial formulas used   : 6
% 0.23/1.41  # Proof object generating inferences   : 4
% 0.23/1.41  # Proof object simplifying inferences  : 4
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 73
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 74
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 74
% 0.23/1.41  # Processed clauses                    : 99
% 0.23/1.41  # ...of these trivial                  : 3
% 0.23/1.41  # ...subsumed                          : 10
% 0.23/1.41  # ...remaining for further processing  : 86
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 52
% 0.23/1.41  # ...of the previous two non-trivial   : 26
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 52
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 86
% 0.23/1.41  #    Positive orientable unit clauses  : 35
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 1
% 0.23/1.41  #    Non-unit-clauses                  : 50
% 0.23/1.41  # Current number of unprocessed clauses: 1
% 0.23/1.41  # ...number of literals in the above   : 3
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 375
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 366
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 10
% 0.23/1.41  # Unit Clause-clause subsumption calls : 51
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 4392
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.016 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.019 s
% 0.23/1.41  # Maximum resident set size: 3296 pages
%------------------------------------------------------------------------------