%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR038-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 : Unsatisfiable 8.27s 3.07s
% Output : CNFRefutation 8.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 23 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-4 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax1_64,axiom,
ifeq4(relationexistsall(X1,X2,X3),true,ifeq4(isa(X4,X3),true,isa(f_relationexistsallfn(X4,X1,X2,X3),X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_64) ).
cnf(ax1_134,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_134) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(ax1_245,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_245) ).
cnf(ax1_673,axiom,
ifeq4(isa(X1,c_tptpcol_16_7738),true,tptpcol_16_7738(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_673) ).
cnf(ax1_244,axiom,
ifeq4(isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),true,tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1_244) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(query88_1,negated_conjecture,
ifeq2(tuple2(tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804),tptpcol_16_7738(X1)),tuple2(true,true),a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query88_1) ).
cnf(ifeq_axiom_002,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(c_0_9,axiom,
ifeq4(relationexistsall(X1,X2,X3),true,ifeq4(isa(X4,X3),true,isa(f_relationexistsallfn(X4,X1,X2,X3),X2),true),true) = true,
ax1_64 ).
cnf(c_0_10,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) = true,
ax1_134 ).
cnf(c_0_11,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_12,plain,
ifeq4(relationexistsall(X1,X2,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),true,isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,X1,X2,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) = true,
ax1_245 ).
cnf(c_0_14,axiom,
ifeq4(isa(X1,c_tptpcol_16_7738),true,tptpcol_16_7738(X1),true) = true,
ax1_673 ).
cnf(c_0_15,plain,
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) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11]) ).
cnf(c_0_16,axiom,
ifeq4(isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),true,tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1),true) = true,
ax1_244 ).
cnf(c_0_17,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_18,negated_conjecture,
ifeq2(tuple2(tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804),tptpcol_16_7738(X1)),tuple2(true,true),a,b) = b,
query88_1 ).
cnf(c_0_19,plain,
tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_20,plain,
tptp_8_968(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11]) ).
cnf(c_0_21,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_22,negated_conjecture,
a != b,
c_0_17 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR038-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.48 % Computer : n014.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Mon Sep 21 14:29:19 UTC 2026
% 0.22/0.49 % CPUTime :
% 0.22/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.55 Running first-order theorem proving
% 0.27/0.55 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
% 8.27/3.07 % Version: 3.5.1
% 8.27/3.07 % Preprocessing class: FMLMSMSLSSSNFFN.
% 8.27/3.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/3.07 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.27/3.07 % Starting new_bool_3 with 600s (2) cores
% 8.27/3.07 % Starting new_bool_1 with 600s (2) cores
% 8.27/3.07 % Starting sh5l with 300s (1) cores
% 8.27/3.07 % new_bool_3 with pid 113028 completed with status 9
% 8.27/3.07 % new_bool_1 with pid 113029 completed with status 9
% 8.27/3.07 % sh5l with pid 113030 completed with status 0
% 8.27/3.07 % Result found by sh5l
% 8.27/3.07 % Preprocessing class: FMLMSMSLSSSNFFN.
% 8.27/3.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/3.07 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.27/3.07 % Starting new_bool_3 with 600s (2) cores
% 8.27/3.07 % Starting new_bool_1 with 600s (2) cores
% 8.27/3.07 % Starting sh5l with 300s (1) cores
% 8.27/3.07 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 8.27/3.07 % SinE strategy is gf500_gu_R04_F100_L20000
% 8.27/3.07 % Search class: FUUPM-FSLM31-MFFFFFNN
% 8.27/3.07 % partial match(1): FUUPM-SSLM31-MFFFFFNN
% 8.27/3.07 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.27/3.07 % Starting SubtermCWHack with 31s (1) cores
% 8.27/3.07 % SubtermCWHack with pid 113038 completed with status 0
% 8.27/3.07 % Result found by SubtermCWHack
% 8.27/3.07 % Preprocessing class: FMLMSMSLSSSNFFN.
% 8.27/3.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/3.07 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.27/3.07 % Starting new_bool_3 with 600s (2) cores
% 8.27/3.07 % Starting new_bool_1 with 600s (2) cores
% 8.27/3.07 % Starting sh5l with 300s (1) cores
% 8.27/3.07 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 8.27/3.07 % SinE strategy is gf500_gu_R04_F100_L20000
% 8.27/3.07 % Search class: FUUPM-FSLM31-MFFFFFNN
% 8.27/3.07 % partial match(1): FUUPM-SSLM31-MFFFFFNN
% 8.27/3.07 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.27/3.07 % Starting SubtermCWHack with 31s (1) cores
% 8.27/3.07 % Preprocessing time : 0.009 s
% 8.27/3.07
% 8.27/3.07 % Proof found!
% 8.27/3.07 % SZS status Unsatisfiable
% 8.27/3.07 % SZS output start CNFRefutation
% See solution above
% 8.27/3.07 % Parsed axioms : 1138
% 8.27/3.07 % Removed by relevancy pruning/SinE : 669
% 8.27/3.07 % Initial clauses : 469
% 8.27/3.07 % Removed in clause preprocessing : 0
% 8.27/3.07 % Initial clauses in saturation : 469
% 8.27/3.07 % Processed clauses : 9565
% 8.27/3.07 % ...of these trivial : 1622
% 8.27/3.07 % ...subsumed : 0
% 8.27/3.07 % ...remaining for further processing : 7943
% 8.27/3.07 % Other redundant clauses eliminated : 0
% 8.27/3.07 % Clauses deleted for lack of memory : 0
% 8.27/3.07 % Backward-subsumed : 0
% 8.27/3.07 % Backward-rewritten : 28
% 8.27/3.07 % Generated clauses : 64485
% 8.27/3.07 % ...of the previous two non-redundant : 9697
% 8.27/3.07 % ...aggressively subsumed : 0
% 8.27/3.07 % Contextual simplify-reflections : 0
% 8.27/3.07 % Paramodulations : 64485
% 8.27/3.07 % Factorizations : 0
% 8.27/3.07 % NegExts : 0
% 8.27/3.07 % Equation resolutions : 0
% 8.27/3.07 % Disequality decompositions : 0
% 8.27/3.07 % Total rewrite steps : 90757
% 8.27/3.07 % ...of those cached : 79022
% 8.27/3.07 % Propositional unsat checks : 0
% 8.27/3.07 % Propositional check models : 0
% 8.27/3.07 % Propositional check unsatisfiable : 0
% 8.27/3.07 % Propositional clauses : 0
% 8.27/3.07 % Propositional clauses after purity: 0
% 8.27/3.07 % Propositional unsat core size : 0
% 8.27/3.07 % Propositional preprocessing time : 0.000
% 8.27/3.07 % Propositional encoding time : 0.000
% 8.27/3.07 % Propositional solver time : 0.000
% 8.27/3.07 % Success case prop preproc time : 0.000
% 8.27/3.07 % Success case prop encoding time : 0.000
% 8.27/3.07 % Success case prop solver time : 0.000
% 8.27/3.07 % Current number of processed clauses : 7915
% 8.27/3.07 % Positive orientable unit clauses : 7914
% 8.27/3.07 % Positive unorientable unit clauses: 0
% 8.27/3.07 % Negative unit clauses : 1
% 8.27/3.07 % Non-unit-clauses : 0
% 8.27/3.07 % Current number of unprocessed clauses: 601
% 8.27/3.07 % ...number of literals in the above : 601
% 8.27/3.07 % Current number of archived formulas : 0
% 8.27/3.07 % Current number of archived clauses : 28
% 8.27/3.07 % Clause-clause subsumption calls (NU) : 0
% 8.27/3.07 % Rec. Clause-clause subsumption calls : 0
% 8.27/3.07 % Non-unit clause-clause subsumptions : 0
% 8.27/3.07 % Unit Clause-clause subsumption calls : 0
% 8.27/3.07 % Rewrite failures with RHS unbound : 0
% 8.27/3.07 % BW rewrite match attempts : 88371
% 8.27/3.07 % BW rewrite match successes : 28
% 8.27/3.07 % Condensation attempts : 0
% 8.27/3.07 % Condensation successes : 0
% 8.27/3.07 % Termbank termtop insertions : 705523
% 8.27/3.07 % Search garbage collected termcells : 1956
% 8.27/3.07
% 8.27/3.07 % -------------------------------------------------
% 8.27/3.07 % User time : 1.894 s
% 8.27/3.07 % System time : 0.121 s
% 8.27/3.07 % Total time : 2.015 s
% 8.27/3.07 % Maximum resident set size: 5960 pages
% 8.27/3.07
% 8.27/3.07 % -------------------------------------------------
% 8.27/3.07 % User time : 3.377 s
% 8.27/3.07 % System time : 0.460 s
% 8.27/3.07 % Total time : 3.836 s
% 8.27/3.07 % Maximum resident set size: 5632 pages
% 8.27/3.07 % E exiting
%------------------------------------------------------------------------------