TSTP Solution File: CSR038+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR038+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : 600s
% DateTime : Fri Jul 15 23:04:17 EDT 2022
% Result : Theorem 0.77s 1.04s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR038+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 10:39:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 21284 was started by sandbox2 on n029.cluster.edu,
% 0.77/1.03 Sat Jun 11 10:39:39 2022
% 0.77/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21131_n029.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_21131_n029.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (73 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationexistsall(PRED,DEPCOL,INDEPCOL) -> isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 2 (all TERM (isa(TERM,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) -> tptp_8_968(f_relationexistsallfn(TERM,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),TERM))) # label(just6) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 3 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 4 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 5 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 7 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 9 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 10 (all X (predicate(X) -> genlpreds(X,X))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 12 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 13 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 14 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 15 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 16 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 17 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 18 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 19 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 20 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 21 (all X (isa(X,c_correctivelensprescription) -> correctivelensprescription(X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 22 (all X (correctivelensprescription(X) -> isa(X,c_correctivelensprescription))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 23 (all ARG1 all INS (products(ARG1,INS) -> artifact(INS))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 24 (all INS all ARG2 (products(INS,ARG2) -> creationordestructionevent(INS))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 25 (all X (isa(X,c_issuingaprescription) -> issuingaprescription(X))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 26 (all X (issuingaprescription(X) -> isa(X,c_issuingaprescription))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 27 (all ARG1 all ARG2 all ARG3 natfunction(f_subcollectionofwithrelationtotypefn(ARG1,ARG2,ARG3),c_subcollectionofwithrelationtotypefn)) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 28 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationtotypefn(ARG1,ARG2,ARG3),n_1,ARG1)) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 29 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationtotypefn(ARG1,ARG2,ARG3),n_2,ARG2)) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 30 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationtotypefn(ARG1,ARG2,ARG3),n_3,ARG3)) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 31 (all ARG1 all ARG2 all ARG3 collection(f_subcollectionofwithrelationtotypefn(ARG1,ARG2,ARG3))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 32 (all X (isa(X,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) -> subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(X))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 33 (all X (subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(X) -> isa(X,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 34 (all X (isa(X,c_tptpcol_16_7738) -> tptpcol_16_7738(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 35 (all X (tptpcol_16_7738(X) -> isa(X,c_tptpcol_16_7738))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 36 (all ARG1 all INS (tptp_8_968(ARG1,INS) -> subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 37 (all INS all ARG2 (tptp_8_968(INS,ARG2) -> tptpcol_7_7172(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 38 (all ARG1 all ARG2 all INS (relationexistsall(ARG1,ARG2,INS) -> collection(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 39 (all ARG1 all INS all ARG3 (relationexistsall(ARG1,INS,ARG3) -> collection(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 40 (all INS all ARG2 all ARG3 (relationexistsall(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 41 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 42 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 43 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 44 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 45 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 46 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 47 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 48 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 49 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 50 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 51 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 52 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 53 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 54 (all X (microtheory(X) -> genlmt(X,X))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 55 (all X (microtheory(X) -> genlmt(X,X))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 56 (all ARG1 all ARG2 all ARG3 all ARG4 natfunction(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),c_relationexistsallfn)) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 57 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1)) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 58 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2)) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 59 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3)) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 60 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4)) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 61 (all ARG1 all ARG2 all ARG3 all ARG4 thing(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4))) # label(just69) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 62 (all ARG1 all INS (resultisaarg(ARG1,INS) -> positiveinteger(INS))) # label(just70) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 63 (all INS all ARG2 (resultisaarg(INS,ARG2) -> function_denotational(INS))) # label(just71) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 64 -(exists X (mtvisible(c_knowledgefragmentd3mt) -> tptp_8_968(X,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) & tptpcol_16_7738(X))) # label(query38) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.03
% 0.77/1.03 ============================== end of process non-clausal formulas ===
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.03
% 0.77/1.03 ============================== PREDICATE ELIMINATION =================
% 0.77/1.03 65 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just49) # label(axiom). [clausify(42)].
% 0.77/1.03 66 transitivebinarypredicate(c_genlmt) # label(just4) # label(axiom). [assumption].
% 0.77/1.03 67 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just48) # label(axiom). [clausify(41)].
% 0.77/1.03 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(65,a,66,a)].
% 0.77/1.03 68 -subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(A) | isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) # label(just40) # label(axiom). [clausify(33)].
% 0.77/1.03 69 subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) # label(just9) # label(axiom). [assumption].
% 0.77/1.03 70 -tptp_8_968(A,B) | subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(B) # label(just43) # label(axiom). [clausify(36)].
% 0.77/1.03 71 -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(A) # label(just39) # label(axiom). [clausify(32)].
% 0.77/1.03 Derived: isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)). [resolve(68,a,69,a)].
% 0.77/1.03 Derived: isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -tptp_8_968(B,A). [resolve(68,a,70,b)].
% 0.77/1.03 72 -resultisaarg(A,B) | positiveinteger(B) # label(just70) # label(axiom). [clausify(62)].
% 0.77/1.03 73 resultisaarg(c_relationexistsallfn,n_3) # label(just2) # label(axiom). [assumption].
% 0.77/1.03 Derived: positiveinteger(n_3). [resolve(72,a,73,a)].
% 0.77/1.03 74 -resultisaarg(A,B) | function_denotational(A) # label(just71) # label(axiom). [clausify(63)].
% 0.77/1.03 Derived: function_denotational(c_relationexistsallfn). [resolve(74,a,73,a)].
% 0.77/1.03 75 -relationexistsall(A,B,C) | binarypredicate(A) # label(just47) # label(axiom). [clausify(40)].
% 0.77/1.03 76 relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) # label(just7) # label(axiom). [assumption].
% 0.77/1.03 Derived: binarypredicate(c_tptp_8_968). [resolve(75,a,76,a)].
% 0.77/1.03 77 -isa(A,B) | -relationexistsall(C,D,B) | isa(f_relationexistsallfn(A,C,D,B),D) # label(just1) # label(axiom). [clausify(1)].
% 0.77/1.03 Derived: -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | isa(f_relationexistsallfn(A,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738). [resolve(77,b,76,a)].
% 0.77/1.03 78 -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | tptp_8_968(f_relationexistsallfn(A,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),A) # label(just6) # label(axiom). [clausify(2)].
% 0.77/1.03 79 -tptp_8_968(A,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) | -tptpcol_16_7738(A) # label(query38) # label(negated_conjecture). [clausify(64)].
% 0.77/1.03 80 -tptp_8_968(A,B) | tptpcol_7_7172(A) # label(just44) # label(axiom). [clausify(37)].
% 0.77/1.03 Derived: -isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))). [resolve(78,b,79,a)].
% 0.77/1.04 Derived: -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | tptpcol_7_7172(f_relationexistsallfn(A,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))). [resolve(78,b,80,a)].
% 0.77/1.04 81 isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -tptp_8_968(B,A). [resolve(68,a,70,b)].
% 0.77/1.04 82 -predicate(A) | genlpreds(A,A) # label(just17) # label(axiom). [clausify(10)].
% 0.77/1.04 83 -genlpreds(A,B) | predicate(B) # label(just12) # label(axiom). [clausify(5)].
% 0.77/1.04 84 -genlpreds(A,B) | predicate(B) # label(just13) # label(axiom). [clausify(6)].
% 0.77/1.04 85 -genlpreds(A,B) | predicate(A) # label(just14) # label(axiom). [clausify(7)].
% 0.77/1.04 86 -genlpreds(A,B) | predicate(A) # label(just15) # label(axiom). [clausify(8)].
% 0.77/1.04 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(82,a,83,b)].
% 0.77/1.04 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(82,a,85,b)].
% 0.77/1.04 87 -predicate(A) | genlpreds(A,A) # label(just18) # label(axiom). [clausify(11)].
% 0.77/1.04 88 -correctivelensprescription(A) | isa(A,c_correctivelensprescription) # label(just29) # label(axiom). [clausify(22)].
% 0.77/1.04 89 -isa(A,c_correctivelensprescription) | correctivelensprescription(A) # label(just28) # label(axiom). [clausify(21)].
% 0.77/1.04 90 -issuingaprescription(A) | isa(A,c_issuingaprescription) # label(just33) # label(axiom). [clausify(26)].
% 0.77/1.04 91 -isa(A,c_issuingaprescription) | issuingaprescription(A) # label(just32) # label(axiom). [clausify(25)].
% 0.77/1.04 92 -tptpcol_16_7738(A) | isa(A,c_tptpcol_16_7738) # label(just42) # label(axiom). [clausify(35)].
% 0.77/1.04 93 -isa(A,c_tptpcol_16_7738) | tptpcol_16_7738(A) # label(just41) # label(axiom). [clausify(34)].
% 0.77/1.04 94 -isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))). [resolve(78,b,79,a)].
% 0.77/1.04 Derived: -isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -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). [resolve(94,b,93,b)].
% 0.77/1.04 95 -microtheory(A) | genlmt(A,A) # label(just61) # label(axiom). [clausify(54)].
% 0.77/1.04 96 -genlmt(A,B) | microtheory(B) # label(just56) # label(axiom). [clausify(49)].
% 0.77/1.04 97 -genlmt(A,B) | microtheory(B) # label(just57) # label(axiom). [clausify(50)].
% 0.77/1.04 98 -genlmt(A,B) | microtheory(A) # label(just58) # label(axiom). [clausify(51)].
% 0.77/1.04 99 -genlmt(A,B) | microtheory(A) # label(just59) # label(axiom). [clausify(52)].
% 0.77/1.04 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(95,a,96,b)].
% 0.77/1.04 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(95,a,98,b)].
% 0.77/1.04 100 -microtheory(A) | genlmt(A,A) # label(just62) # label(axiom). [clausify(55)].
% 0.77/1.04
% 0.77/1.04 ============================== end predicate elimination =============
% 0.77/1.04
% 0.77/1.04 Auto_denials:
% 0.77/1.04 % copying label just10 to answer in negative clause
% 0.77/1.04 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.77/1.04
% 0.77/1.04 Term ordering decisions:
% 0.77/1.04 Function symbol KB weights: c_correctivelensprescription=1. c_issuingaprescription=1. c_products=1. c_basekb=1. c_knowledgefragmentd3mt=1. c_tptpcol_16_7738=1. c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804=1. c_universalvocabularymt=1. c_genlmt=1. c_tptp_8_968=1. c_transitivebinarypredicate=1. f_subcollectionofwithrelationtotypefn=1. f_relationexistsallfn=1.
% 0.77/1.04
% 0.77/1.04 ============================== end of process initial clauses ========
% 0.77/1.04
% 0.77/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.04
% 0.77/1.04 ============================== end of clauses for search =============
% 0.77/1.04
% 0.77/1.04 ============================== SEARCH ================================
% 0.77/1.04
% 0.77/1.04 % Starting search at 0.02 seconds.
% 0.77/1.04
% 0.77/1.04 ============================== PROOF =================================
% 0.77/1.04 % SZS status Theorem
% 0.77/1.04 % SZS output start Refutation
% 0.77/1.04
% 0.77/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.77/1.04 % Length of proof is 15.
% 0.77/1.04 % Level of proof is 5.
% 0.77/1.04 % Maximum clause weight is 16.000.
% 0.77/1.04 % Given clauses 16.
% 0.77/1.04
% 0.77/1.04 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationexistsall(PRED,DEPCOL,INDEPCOL) -> isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 2 (all TERM (isa(TERM,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) -> tptp_8_968(f_relationexistsallfn(TERM,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),TERM))) # label(just6) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 34 (all X (isa(X,c_tptpcol_16_7738) -> tptpcol_16_7738(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 64 -(exists X (mtvisible(c_knowledgefragmentd3mt) -> tptp_8_968(X,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) & tptpcol_16_7738(X))) # label(query38) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.04 76 relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) # label(just7) # label(axiom). [assumption].
% 0.77/1.04 77 -isa(A,B) | -relationexistsall(C,D,B) | isa(f_relationexistsallfn(A,C,D,B),D) # label(just1) # label(axiom). [clausify(1)].
% 0.77/1.04 78 -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | tptp_8_968(f_relationexistsallfn(A,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),A) # label(just6) # label(axiom). [clausify(2)].
% 0.77/1.04 79 -tptp_8_968(A,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) | -tptpcol_16_7738(A) # label(query38) # label(negated_conjecture). [clausify(64)].
% 0.77/1.04 93 -isa(A,c_tptpcol_16_7738) | tptpcol_16_7738(A) # label(just41) # label(axiom). [clausify(34)].
% 0.77/1.04 94 -isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))). [resolve(78,b,79,a)].
% 0.77/1.04 106 isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) # label(just8) # label(axiom). [assumption].
% 0.77/1.04 116 -isa(A,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | isa(f_relationexistsallfn(A,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738). [resolve(77,b,76,a)].
% 0.77/1.04 119 -isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) | -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). [resolve(94,b,93,b)].
% 0.77/1.04 120 -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). [copy(119),unit_del(a,106)].
% 0.77/1.04 132 $F. [ur(116,a,106,a),unit_del(a,120)].
% 0.77/1.04
% 0.77/1.04 % SZS output end Refutation
% 0.77/1.04 ============================== end of proof ==========================
% 0.77/1.04
% 0.77/1.04 % Disable descendants (x means already disabled):
% 0.77/1.04 79x 94x 119x 120
% 0.77/1.04
% 0.77/1.04 ============================== STATISTICS ============================
% 0.77/1.04
% 0.77/1.04 Given=36. Generated=95. Kept=37. proofs=1.
% 0.77/1.04 Usable=35. Sos=0. Demods=0. Limbo=0, Disabled=90. Hints=0.
% 0.77/1.04 Megabytes=0.14.
% 0.77/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of statistics =====================
% 0.77/1.04
% 0.77/1.04 ============================== end of search =========================
% 0.77/1.04
% 0.77/1.04 SEARCH FAILED
% 0.77/1.04
% 0.77/1.04 Exiting with 1 proof.
% 0.77/1.04
% 0.77/1.04 Process 21284 exit (sos_empty) Sat Jun 11 10:39:39 2022
% 0.77/1.04 Prover9 interrupted
%------------------------------------------------------------------------------