%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR038+3 : 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 : n001.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:18:07 PM UTC 2026
% Result : Theorem 0.58s 0.63s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 11 |; 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 : 23 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query138,conjecture,
? [X15] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptpcol_16_7738(X15)
& tptp_8_968(X15,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query138) ).
fof(ax2_7785,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_7738)
=> tptpcol_16_7738(X15) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_7785) ).
fof(ax2_85,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+2.ax',ax2_85) ).
fof(ax2_1129,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1129) ).
fof(ax2_453,axiom,
! [X7,X8,X9,X10] :
( ( relationexistsall(X9,X10,X8)
& isa(X7,X8) )
=> isa(f_relationexistsallfn(X7,X9,X10,X8),X10) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_453) ).
fof(ax2_86,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+2.ax',ax2_86) ).
fof(c_0_6,negated_conjecture,
~ ? [X15] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptpcol_16_7738(X15)
& tptp_8_968(X15,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ) ),
inference(assume_negation,[status(cth)],[query138]) ).
fof(c_0_7,negated_conjecture,
! [X23] :
( ( ~ tptpcol_16_7738(X23)
| ~ tptp_8_968(X23,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,
! [X24] :
( tptpcol_16_7738(X24)
| ~ isa(X24,c_tptpcol_16_7738) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7785])])]) ).
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,
! [X26] :
( tptp_8_968(f_relationexistsallfn(X26,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X26)
| ~ isa(X26,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_85])])]) ).
cnf(c_0_12,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_13,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_14,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax2_1129]) ).
fof(c_0_15,plain,
! [X32,X33,X34,X35] :
( isa(f_relationexistsallfn(X32,X34,X35,X33),X35)
| ~ relationexistsall(X34,X35,X33)
| ~ isa(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_453])])]) ).
cnf(c_0_16,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_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ~ relationexistsall(X3,X4,X2)
| ~ isa(X1,X2)
| isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
inference(split_conjunct,[status(thm)],[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)],[ax2_86]) ).
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_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR038+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 14:34:59 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.43 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.58/0.63 % Version: 3.5.1
% 0.58/0.63 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.58/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.58/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.58/0.63 % Starting sh5l with 300s (1) cores
% 0.58/0.63 % new_bool_1 with pid 3374073 completed with status 0
% 0.58/0.63 % Result found by new_bool_1
% 0.58/0.63 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.58/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.58/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.58/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.58/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.63 % Search class: FHHNM-FFMM32-SFFFFFNN
% 0.58/0.63 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.58/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.58/0.63 % SubtermCWHack with pid 3374076 completed with status 0
% 0.58/0.63 % Result found by SubtermCWHack
% 0.58/0.63 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.58/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.58/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.58/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.58/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.63 % Search class: FHHNM-FFMM32-SFFFFFNN
% 0.58/0.63 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.58/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.58/0.63 % Preprocessing time : 0.006 s
% 0.58/0.63
% 0.58/0.63 % Proof found!
% 0.58/0.63 % SZS status Theorem
% 0.58/0.63 % SZS output start CNFRefutation
% See solution above
% 0.58/0.63 % Parsed axioms : 8006
% 0.58/0.63 % Removed by relevancy pruning/SinE : 7943
% 0.58/0.63 % Initial clauses : 64
% 0.58/0.63 % Removed in clause preprocessing : 0
% 0.58/0.63 % Initial clauses in saturation : 64
% 0.58/0.63 % Processed clauses : 71
% 0.58/0.63 % ...of these trivial : 4
% 0.58/0.63 % ...subsumed : 13
% 0.58/0.63 % ...remaining for further processing : 54
% 0.58/0.63 % Other redundant clauses eliminated : 0
% 0.58/0.63 % Clauses deleted for lack of memory : 0
% 0.58/0.63 % Backward-subsumed : 0
% 0.58/0.63 % Backward-rewritten : 0
% 0.58/0.63 % Generated clauses : 19
% 0.58/0.63 % ...of the previous two non-redundant : 8
% 0.58/0.63 % ...aggressively subsumed : 0
% 0.58/0.63 % Contextual simplify-reflections : 0
% 0.58/0.63 % Paramodulations : 19
% 0.58/0.63 % Factorizations : 0
% 0.58/0.63 % NegExts : 0
% 0.58/0.63 % Equation resolutions : 0
% 0.58/0.63 % Disequality decompositions : 0
% 0.58/0.63 % Total rewrite steps : 14
% 0.58/0.63 % ...of those cached : 6
% 0.58/0.63 % Propositional unsat checks : 0
% 0.58/0.63 % Propositional check models : 0
% 0.58/0.63 % Propositional check unsatisfiable : 0
% 0.58/0.63 % Propositional clauses : 0
% 0.58/0.63 % Propositional clauses after purity: 0
% 0.58/0.63 % Propositional unsat core size : 0
% 0.58/0.63 % Propositional preprocessing time : 0.000
% 0.58/0.63 % Propositional encoding time : 0.000
% 0.58/0.63 % Propositional solver time : 0.000
% 0.58/0.63 % Success case prop preproc time : 0.000
% 0.58/0.63 % Success case prop encoding time : 0.000
% 0.58/0.63 % Success case prop solver time : 0.000
% 0.58/0.63 % Current number of processed clauses : 54
% 0.58/0.63 % Positive orientable unit clauses : 29
% 0.58/0.63 % Positive unorientable unit clauses: 0
% 0.58/0.63 % Negative unit clauses : 1
% 0.58/0.63 % Non-unit-clauses : 24
% 0.58/0.63 % Current number of unprocessed clauses: 1
% 0.58/0.63 % ...number of literals in the above : 2
% 0.58/0.63 % Current number of archived formulas : 0
% 0.58/0.63 % Current number of archived clauses : 0
% 0.58/0.63 % Clause-clause subsumption calls (NU) : 123
% 0.58/0.63 % Rec. Clause-clause subsumption calls : 97
% 0.58/0.63 % Non-unit clause-clause subsumptions : 13
% 0.58/0.63 % Unit Clause-clause subsumption calls : 5
% 0.58/0.63 % Rewrite failures with RHS unbound : 0
% 0.58/0.63 % BW rewrite match attempts : 0
% 0.58/0.63 % BW rewrite match successes : 0
% 0.58/0.63 % Condensation attempts : 0
% 0.58/0.63 % Condensation successes : 0
% 0.58/0.63 % Termbank termtop insertions : 54038
% 0.58/0.63 % Search garbage collected termcells : 31093
% 0.58/0.63
% 0.58/0.63 % -------------------------------------------------
% 0.58/0.63 % User time : 0.030 s
% 0.58/0.63 % System time : 0.031 s
% 0.58/0.63 % Total time : 0.061 s
% 0.58/0.63 % Maximum resident set size: 20084 pages
% 0.58/0.63
% 0.58/0.63 % -------------------------------------------------
% 0.58/0.63 % User time : 0.145 s
% 0.58/0.63 % System time : 0.046 s
% 0.58/0.63 % Total time : 0.191 s
% 0.58/0.63 % Maximum resident set size: 11264 pages
% 0.58/0.63 % E exiting
%------------------------------------------------------------------------------