↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR038+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:16:06 PM UTC 2026

% Result   : Theorem 0.22s 20.93s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   37 (  16   ~;  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   :   25 (   0 sgn  13   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query238,conjecture,
    ? [X23] :
      ( mtvisible(c_knowledgefragmentd3mt)
     => ( tptpcol_16_7738(X23)
        & tptp_8_968(X23,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query238) ).

fof(ax4_59513,axiom,
    ! [X6] :
      ( isa(X6,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
     => tptp_8_968(f_relationexistsallfn(X6,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_59513) ).

fof(ax4_470078,axiom,
    ! [X23] :
      ( isa(X23,c_tptpcol_16_7738)
     => tptpcol_16_7738(X23) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_470078) ).

fof(ax4_46691,axiom,
    ! [X6,X9,X10,X11] :
      ( ( relationexistsall(X10,X11,X9)
        & isa(X6,X9) )
     => isa(f_relationexistsallfn(X6,X10,X11,X9),X11) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_46691) ).

fof(ax4_19965,axiom,
    isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_19965) ).

fof(ax4_59514,axiom,
    relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_59514) ).

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

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

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

fof(c_0_9,plain,
    ! [X31] :
      ( tptpcol_16_7738(X31)
      | ~ isa(X31,c_tptpcol_16_7738) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_470078])])]) ).

fof(c_0_10,plain,
    ! [X47,X48,X49,X50] :
      ( isa(f_relationexistsallfn(X47,X49,X50,X48),X50)
      | ~ relationexistsall(X49,X50,X48)
      | ~ isa(X47,X48) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_46691])])]) ).

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

cnf(c_0_12,plain,
    ( ~ 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) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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

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

cnf(c_0_16,negated_conjecture,
    ~ tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,plain,
    ( ~ isa(X1,X3)
    | ~ relationexistsall(X2,c_tptpcol_16_7738,X3)
    | tptpcol_16_7738(f_relationexistsallfn(X1,X2,c_tptpcol_16_7738,X3)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR038+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  % Computer : n016.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.42  % CPULimit : 300
% 0.15/0.42  % WCLimit  : 300
% 0.15/0.42  % DateTime : Mon Sep 21 14:34:39 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.49  Running first-order theorem proving
% 0.15/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/20.93  % Version: 3.5.1
% 0.22/20.93  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.22/20.93  % Scheduled 4 strats onto 8 cores with 287 seconds (2296 total)
% 0.22/20.93  % Starting new_ho_10 with 574s (2) cores
% 0.22/20.93  % Starting sh3 with 574s (2) cores
% 0.22/20.93  % Starting ho_unfolding_3 with 574s (2) cores
% 0.22/20.93  % Starting new_ho_10_cnf2 with 574s (2) cores
% 0.22/20.93  % new_ho_10 with pid 2670124 completed with status 0
% 0.22/20.93  % Result found by new_ho_10
% 0.22/20.93  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.22/20.93  % Scheduled 4 strats onto 8 cores with 287 seconds (2296 total)
% 0.22/20.93  % Starting new_ho_10 with 574s (2) cores
% 0.22/20.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/20.93  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.22/20.93  % Search class: FHHSM-SSLM31-MFFFFFNN
% 0.22/20.93  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.22/20.93  % Scheduled 7 strats onto 2 cores with 570 seconds (570 total)
% 0.22/20.93  % Starting SubtermCWHack with 52s (1) cores
% 0.22/20.93  % Starting new_ho_10 with 58s (1) cores
% 0.22/20.93  % new_ho_10 with pid 2670283 completed with status 0
% 0.22/20.93  % Result found by new_ho_10
% 0.22/20.93  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.22/20.93  % Scheduled 4 strats onto 8 cores with 287 seconds (2296 total)
% 0.22/20.93  % Starting new_ho_10 with 574s (2) cores
% 0.22/20.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/20.93  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.22/20.93  % Search class: FHHSM-SSLM31-MFFFFFNN
% 0.22/20.93  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.22/20.93  % Scheduled 7 strats onto 2 cores with 570 seconds (570 total)
% 0.22/20.93  % Starting SubtermCWHack with 52s (1) cores
% 0.22/20.93  % Starting new_ho_10 with 58s (1) cores
% 0.22/20.93  % Preprocessing time       : 0.439 s
% 0.22/20.93  % Presaturation interreduction done
% 0.22/20.93  
% 0.22/20.93  % Proof found!
% 0.22/20.93  % SZS status Theorem
% 0.22/20.93  % SZS output start CNFRefutation
% See solution above
% 0.22/20.93  % Parsed axioms                        : 540250
% 0.22/20.93  % Removed by relevancy pruning/SinE    : 539151
% 0.22/20.93  % Initial clauses                      : 1100
% 0.22/20.93  % Removed in clause preprocessing      : 2
% 0.22/20.93  % Initial clauses in saturation        : 1098
% 0.22/20.93  % Processed clauses                    : 3282
% 0.22/20.93  % ...of these trivial                  : 134
% 0.22/20.93  % ...subsumed                          : 176
% 0.22/20.93  % ...remaining for further processing  : 2972
% 0.22/20.93  % Other redundant clauses eliminated   : 1
% 0.22/20.93  % Clauses deleted for lack of memory   : 0
% 0.22/20.93  % Backward-subsumed                    : 8
% 0.22/20.93  % Backward-rewritten                   : 21
% 0.22/20.93  % Generated clauses                    : 4793
% 0.22/20.93  % ...of the previous two non-redundant : 4076
% 0.22/20.93  % ...aggressively subsumed             : 0
% 0.22/20.93  % Contextual simplify-reflections      : 1
% 0.22/20.93  % Paramodulations                      : 4792
% 0.22/20.93  % Factorizations                       : 0
% 0.22/20.93  % NegExts                              : 0
% 0.22/20.93  % Equation resolutions                 : 1
% 0.22/20.93  % Disequality decompositions           : 0
% 0.22/20.93  % Total rewrite steps                  : 938
% 0.22/20.93  % ...of those cached                   : 671
% 0.22/20.93  % Propositional unsat checks           : 0
% 0.22/20.93  %    Propositional check models        : 0
% 0.22/20.93  %    Propositional check unsatisfiable : 0
% 0.22/20.93  %    Propositional clauses             : 0
% 0.22/20.93  %    Propositional clauses after purity: 0
% 0.22/20.93  %    Propositional unsat core size     : 0
% 0.22/20.93  %    Propositional preprocessing time  : 0.000
% 0.22/20.93  %    Propositional encoding time       : 0.000
% 0.22/20.93  %    Propositional solver time         : 0.000
% 0.22/20.93  %    Success case prop preproc time    : 0.000
% 0.22/20.93  %    Success case prop encoding time   : 0.000
% 0.22/20.93  %    Success case prop solver time     : 0.000
% 0.22/20.93  % Current number of processed clauses  : 2006
% 0.22/20.93  %    Positive orientable unit clauses  : 633
% 0.22/20.93  %    Positive unorientable unit clauses: 0
% 0.22/20.93  %    Negative unit clauses             : 78
% 0.22/20.93  %    Non-unit-clauses                  : 1295
% 0.22/20.93  % Current number of unprocessed clauses: 2797
% 0.22/20.93  % ...number of literals in the above   : 7930
% 0.22/20.93  % Current number of archived formulas  : 0
% 0.22/20.93  % Current number of archived clauses   : 965
% 0.22/20.93  % Clause-clause subsumption calls (NU) : 238828
% 0.22/20.93  % Rec. Clause-clause subsumption calls : 189226
% 0.22/20.93  % Non-unit clause-clause subsumptions  : 180
% 0.22/20.93  % Unit Clause-clause subsumption calls : 23622
% 0.22/20.93  % Rewrite failures with RHS unbound    : 0
% 0.22/20.93  % BW rewrite match attempts            : 377
% 0.22/20.93  % BW rewrite match successes           : 20
% 0.22/20.93  % Condensation attempts                : 3311
% 0.22/20.93  % Condensation successes               : 0
% 0.22/20.93  % Termbank termtop insertions          : 3780117
% 0.22/20.93  % Search garbage collected termcells   : 2174297
% 0.22/20.93  
% 0.22/20.93  % -------------------------------------------------
% 0.22/20.93  % User time                : 3.965 s
% 0.22/20.93  % System time              : 1.731 s
% 0.22/20.93  % Total time               : 5.696 s
% 0.22/20.93  % Maximum resident set size: 1242148 pages
% 0.22/20.93  
% 0.22/20.93  % -------------------------------------------------
% 0.22/20.93  % User time                : 18.407 s
% 0.22/20.93  % System time              : 2.922 s
% 0.22/20.93  % Total time               : 21.329 s
% 0.22/20.93  % Maximum resident set size: 456704 pages
% 0.22/20.93  % E exiting
%------------------------------------------------------------------------------