TSTP Solution File: CSR038-10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR038-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 300s
% DateTime : Mon May 20 19:17:25 EDT 2024
% Result : Unsatisfiable 8.58s 1.60s
% Output : CNFRefutation 8.58s
% 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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax1_134) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax1_244) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',query88_1) ).
cnf(ifeq_axiom_002,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/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.07/0.12 % Problem : CSR038-10 : TPTP v8.2.0. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 00:38:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.58/1.60 # Version: 3.1.0
% 8.58/1.60 # Preprocessing class: FMLMSMSLSSSNFFN.
% 8.58/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.58/1.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.58/1.60 # Starting new_bool_3 with 600s (2) cores
% 8.58/1.60 # Starting new_bool_1 with 600s (2) cores
% 8.58/1.60 # Starting sh5l with 300s (1) cores
% 8.58/1.60 # sh5l with pid 16934 completed with status 0
% 8.58/1.60 # Result found by sh5l
% 8.58/1.60 # Preprocessing class: FMLMSMSLSSSNFFN.
% 8.58/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.58/1.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.58/1.60 # Starting new_bool_3 with 600s (2) cores
% 8.58/1.60 # Starting new_bool_1 with 600s (2) cores
% 8.58/1.60 # Starting sh5l with 300s (1) cores
% 8.58/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.58/1.60 # Search class: FUUPM-FSLM31-MFFFFFNN
% 8.58/1.60 # partial match(1): FUUPM-SSLM31-MFFFFFNN
% 8.58/1.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.58/1.60 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 8.58/1.60 # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16939 completed with status 0
% 8.58/1.60 # Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.58/1.60 # Preprocessing class: FMLMSMSLSSSNFFN.
% 8.58/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.58/1.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 8.58/1.60 # Starting new_bool_3 with 600s (2) cores
% 8.58/1.60 # Starting new_bool_1 with 600s (2) cores
% 8.58/1.60 # Starting sh5l with 300s (1) cores
% 8.58/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.58/1.60 # Search class: FUUPM-FSLM31-MFFFFFNN
% 8.58/1.60 # partial match(1): FUUPM-SSLM31-MFFFFFNN
% 8.58/1.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.58/1.60 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 8.58/1.60 # Preprocessing time : 0.005 s
% 8.58/1.60 # Presaturation interreduction done
% 8.58/1.60
% 8.58/1.60 # Proof found!
% 8.58/1.60 # SZS status Unsatisfiable
% 8.58/1.60 # SZS output start CNFRefutation
% See solution above
% 8.58/1.60 # Parsed axioms : 1138
% 8.58/1.60 # Removed by relevancy pruning/SinE : 669
% 8.58/1.60 # Initial clauses : 469
% 8.58/1.60 # Removed in clause preprocessing : 0
% 8.58/1.60 # Initial clauses in saturation : 469
% 8.58/1.60 # Processed clauses : 10275
% 8.58/1.60 # ...of these trivial : 1893
% 8.58/1.60 # ...subsumed : 0
% 8.58/1.60 # ...remaining for further processing : 8382
% 8.58/1.60 # Other redundant clauses eliminated : 0
% 8.58/1.60 # Clauses deleted for lack of memory : 0
% 8.58/1.60 # Backward-subsumed : 0
% 8.58/1.60 # Backward-rewritten : 28
% 8.58/1.60 # Generated clauses : 64137
% 8.58/1.60 # ...of the previous two non-redundant : 10337
% 8.58/1.60 # ...aggressively subsumed : 0
% 8.58/1.60 # Contextual simplify-reflections : 0
% 8.58/1.60 # Paramodulations : 64137
% 8.58/1.60 # Factorizations : 0
% 8.58/1.60 # NegExts : 0
% 8.58/1.60 # Equation resolutions : 0
% 8.58/1.60 # Disequality decompositions : 0
% 8.58/1.60 # Total rewrite steps : 89894
% 8.58/1.60 # ...of those cached : 78393
% 8.58/1.60 # Propositional unsat checks : 1
% 8.58/1.60 # Propositional check models : 1
% 8.58/1.60 # Propositional check unsatisfiable : 0
% 8.58/1.60 # Propositional clauses : 0
% 8.58/1.60 # Propositional clauses after purity: 0
% 8.58/1.60 # Propositional unsat core size : 0
% 8.58/1.60 # Propositional preprocessing time : 0.000
% 8.58/1.60 # Propositional encoding time : 0.014
% 8.58/1.60 # Propositional solver time : 0.000
% 8.58/1.60 # Success case prop preproc time : 0.000
% 8.58/1.60 # Success case prop encoding time : 0.000
% 8.58/1.60 # Success case prop solver time : 0.000
% 8.58/1.60 # Current number of processed clauses : 7908
% 8.58/1.60 # Positive orientable unit clauses : 7907
% 8.58/1.60 # Positive unorientable unit clauses: 0
% 8.58/1.60 # Negative unit clauses : 1
% 8.58/1.60 # Non-unit-clauses : 0
% 8.58/1.60 # Current number of unprocessed clauses: 977
% 8.58/1.60 # ...number of literals in the above : 977
% 8.58/1.60 # Current number of archived formulas : 0
% 8.58/1.60 # Current number of archived clauses : 474
% 8.58/1.60 # Clause-clause subsumption calls (NU) : 0
% 8.58/1.60 # Rec. Clause-clause subsumption calls : 0
% 8.58/1.60 # Non-unit clause-clause subsumptions : 0
% 8.58/1.60 # Unit Clause-clause subsumption calls : 0
% 8.58/1.60 # Rewrite failures with RHS unbound : 0
% 8.58/1.60 # BW rewrite match attempts : 70708
% 8.58/1.60 # BW rewrite match successes : 28
% 8.58/1.60 # Condensation attempts : 0
% 8.58/1.60 # Condensation successes : 0
% 8.58/1.60 # Termbank termtop insertions : 739159
% 8.58/1.60 # Search garbage collected termcells : 1956
% 8.58/1.60
% 8.58/1.60 # -------------------------------------------------
% 8.58/1.60 # User time : 0.997 s
% 8.58/1.60 # System time : 0.054 s
% 8.58/1.60 # Total time : 1.052 s
% 8.58/1.60 # Maximum resident set size: 4036 pages
% 8.58/1.60
% 8.58/1.60 # -------------------------------------------------
% 8.58/1.60 # User time : 1.013 s
% 8.58/1.60 # System time : 0.058 s
% 8.58/1.60 # Total time : 1.071 s
% 8.58/1.60 # Maximum resident set size: 2448 pages
% 8.58/1.60 % E---3.1 exiting
%------------------------------------------------------------------------------