%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR038+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:05 PM UTC 2026
% Result : Theorem 0.66s 0.66s
% Output : CNFRefutation 0.66s
% 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(query88,conjecture,
? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptpcol_16_7738(X13)
& tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query88) ).
fof(ax1_673,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_7738)
=> tptpcol_16_7738(X13) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_673) ).
fof(ax1_244,axiom,
! [X7] :
( isa(X7,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
=> tptp_8_968(f_relationexistsallfn(X7,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_244) ).
fof(ax1_64,axiom,
! [X7,X8,X3,X9] :
( ( relationexistsall(X3,X9,X8)
& isa(X7,X8) )
=> isa(f_relationexistsallfn(X7,X3,X9,X8),X9) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_134,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_134) ).
fof(ax1_245,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_245) ).
fof(c_0_6,negated_conjecture,
~ ? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptpcol_16_7738(X13)
& tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ) ),
inference(assume_negation,[status(cth)],[query88]) ).
fof(c_0_7,negated_conjecture,
! [X22] :
( ( ~ tptpcol_16_7738(X22)
| ~ tptp_8_968(X22,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,
! [X23] :
( tptpcol_16_7738(X23)
| ~ isa(X23,c_tptpcol_16_7738) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_673])])]) ).
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,
( ~ isa(X1,c_tptpcol_16_7738)
| tptpcol_16_7738(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X25] :
( tptp_8_968(f_relationexistsallfn(X25,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X25)
| ~ isa(X25,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_244])])]) ).
fof(c_0_12,plain,
! [X35,X36,X37,X38] :
( isa(f_relationexistsallfn(X35,X37,X38,X36),X38)
| ~ relationexistsall(X37,X38,X36)
| ~ isa(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ isa(X1,c_tptpcol_16_7738)
| ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax1_134]) ).
cnf(c_0_16,plain,
( ~ relationexistsall(X3,X4,X2)
| ~ isa(X1,X2)
| isa(f_relationexistsallfn(X1,X3,X4,X2),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)],[ax1_245]) ).
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(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| isa(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738) ),
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.03 % Problem : CSR038+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n009.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 14:29:27 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.66/0.66 % Version: 3.5.1
% 0.66/0.66 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.66/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.66 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.66/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.66/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.66/0.66 % Starting sh5l with 300s (1) cores
% 0.66/0.66 % sh5l with pid 2006597 completed with status 0
% 0.66/0.66 % Result found by sh5l
% 0.66/0.66 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.66/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.66 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.66/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.66/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.66/0.66 % Starting sh5l with 300s (1) cores
% 0.66/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.66/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.66/0.66 % Search class: FHHNM-FFMM31-SFFFFFNN
% 0.66/0.66 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.66/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.66/0.66 % SubtermCWHack with pid 2006608 completed with status 0
% 0.66/0.66 % Result found by SubtermCWHack
% 0.66/0.66 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.66/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.66 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.66/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.66/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.66/0.66 % Starting sh5l with 300s (1) cores
% 0.66/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.66/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.66/0.66 % Search class: FHHNM-FFMM31-SFFFFFNN
% 0.66/0.66 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.66/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.66/0.66 % Preprocessing time : 0.005 s
% 0.66/0.66
% 0.66/0.66 % Proof found!
% 0.66/0.66 % SZS status Theorem
% 0.66/0.66 % SZS output start CNFRefutation
% See solution above
% 0.66/0.66 % Parsed axioms : 1132
% 0.66/0.66 % Removed by relevancy pruning/SinE : 909
% 0.66/0.66 % Initial clauses : 224
% 0.66/0.66 % Removed in clause preprocessing : 0
% 0.66/0.66 % Initial clauses in saturation : 224
% 0.66/0.66 % Processed clauses : 748
% 0.66/0.66 % ...of these trivial : 0
% 0.66/0.66 % ...subsumed : 131
% 0.66/0.66 % ...remaining for further processing : 617
% 0.66/0.66 % Other redundant clauses eliminated : 0
% 0.66/0.66 % Clauses deleted for lack of memory : 0
% 0.66/0.66 % Backward-subsumed : 38
% 0.66/0.66 % Backward-rewritten : 0
% 0.66/0.66 % Generated clauses : 837
% 0.66/0.66 % ...of the previous two non-redundant : 603
% 0.66/0.66 % ...aggressively subsumed : 0
% 0.66/0.66 % Contextual simplify-reflections : 0
% 0.66/0.66 % Paramodulations : 837
% 0.66/0.66 % Factorizations : 0
% 0.66/0.66 % NegExts : 0
% 0.66/0.66 % Equation resolutions : 0
% 0.66/0.66 % Disequality decompositions : 0
% 0.66/0.66 % Total rewrite steps : 222
% 0.66/0.66 % ...of those cached : 147
% 0.66/0.66 % Propositional unsat checks : 0
% 0.66/0.66 % Propositional check models : 0
% 0.66/0.66 % Propositional check unsatisfiable : 0
% 0.66/0.66 % Propositional clauses : 0
% 0.66/0.66 % Propositional clauses after purity: 0
% 0.66/0.66 % Propositional unsat core size : 0
% 0.66/0.66 % Propositional preprocessing time : 0.000
% 0.66/0.66 % Propositional encoding time : 0.000
% 0.66/0.66 % Propositional solver time : 0.000
% 0.66/0.66 % Success case prop preproc time : 0.000
% 0.66/0.66 % Success case prop encoding time : 0.000
% 0.66/0.66 % Success case prop solver time : 0.000
% 0.66/0.66 % Current number of processed clauses : 579
% 0.66/0.66 % Positive orientable unit clauses : 203
% 0.66/0.66 % Positive unorientable unit clauses: 0
% 0.66/0.66 % Negative unit clauses : 35
% 0.66/0.66 % Non-unit-clauses : 341
% 0.66/0.66 % Current number of unprocessed clauses: 75
% 0.66/0.66 % ...number of literals in the above : 210
% 0.66/0.66 % Current number of archived formulas : 0
% 0.66/0.66 % Current number of archived clauses : 38
% 0.66/0.66 % Clause-clause subsumption calls (NU) : 26700
% 0.66/0.66 % Rec. Clause-clause subsumption calls : 22478
% 0.66/0.66 % Non-unit clause-clause subsumptions : 90
% 0.66/0.66 % Unit Clause-clause subsumption calls : 3369
% 0.66/0.66 % Rewrite failures with RHS unbound : 0
% 0.66/0.66 % BW rewrite match attempts : 0
% 0.66/0.66 % BW rewrite match successes : 0
% 0.66/0.66 % Condensation attempts : 0
% 0.66/0.66 % Condensation successes : 0
% 0.66/0.66 % Termbank termtop insertions : 24918
% 0.66/0.66 % Search garbage collected termcells : 5049
% 0.66/0.66
% 0.66/0.66 % -------------------------------------------------
% 0.66/0.66 % User time : 0.056 s
% 0.66/0.66 % System time : 0.011 s
% 0.66/0.66 % Total time : 0.067 s
% 0.66/0.66 % Maximum resident set size: 6604 pages
% 0.66/0.66
% 0.66/0.66 % -------------------------------------------------
% 0.66/0.66 % User time : 0.070 s
% 0.66/0.66 % System time : 0.020 s
% 0.66/0.66 % Total time : 0.090 s
% 0.66/0.66 % Maximum resident set size: 5632 pages
% 0.66/0.66 % E exiting
%------------------------------------------------------------------------------