%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR038+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n016.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 03:07:16 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : CSR038+1 : TPTP v8.1.0. Released v3.4.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n016.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jun 11 10:50:41 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 74 Number of unprocessed: 66 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 66 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 21 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 45 extension rule candidate clauses % 0.13/0.37 # 21 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_74, negated_conjecture, (mtvisible(c_knowledgefragmentd3mt))). % 0.13/0.37 cnf(i_0_9, plain, (subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804))). % 0.13/0.37 cnf(i_0_63, plain, (mtvisible(c_basekb))). % 0.13/0.37 cnf(i_0_72, plain, (mtvisible(c_universalvocabularymt))). % 0.13/0.37 cnf(i_0_4, plain, (transitivebinarypredicate(c_genlmt))). % 0.13/0.37 cnf(i_0_3, plain, (genlmt(c_knowledgefragmentd3mt,c_basekb))). % 0.13/0.37 cnf(i_0_2, plain, (resultisaarg(c_relationexistsallfn,n_3))). % 0.13/0.37 cnf(i_0_5, plain, (genlmt(c_basekb,c_universalvocabularymt))). % 0.13/0.37 cnf(i_0_38, plain, (collection(f_subcollectionofwithrelationtotypefn(X1,X2,X3)))). % 0.13/0.37 cnf(i_0_8, plain, (isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))). % 0.13/0.37 cnf(i_0_34, plain, (natfunction(f_subcollectionofwithrelationtotypefn(X1,X2,X3),c_subcollectionofwithrelationtotypefn))). % 0.13/0.37 cnf(i_0_69, plain, (thing(f_relationexistsallfn(X1,X2,X3,X4)))). % 0.13/0.37 cnf(i_0_7, plain, (relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))). % 0.13/0.37 cnf(i_0_37, plain, (natargument(f_subcollectionofwithrelationtotypefn(X1,X2,X3),n_3,X3))). % 0.13/0.37 cnf(i_0_35, plain, (natargument(f_subcollectionofwithrelationtotypefn(X1,X2,X3),n_1,X1))). % 0.13/0.37 cnf(i_0_36, plain, (natargument(f_subcollectionofwithrelationtotypefn(X1,X2,X3),n_2,X2))). % 0.13/0.37 cnf(i_0_64, plain, (natfunction(f_relationexistsallfn(X1,X2,X3,X4),c_relationexistsallfn))). % 0.13/0.37 cnf(i_0_67, plain, (natargument(f_relationexistsallfn(X1,X2,X3,X4),n_3,X3))). % 0.13/0.37 cnf(i_0_65, plain, (natargument(f_relationexistsallfn(X1,X2,X3,X4),n_1,X1))). % 0.13/0.37 cnf(i_0_66, plain, (natargument(f_relationexistsallfn(X1,X2,X3,X4),n_2,X2))). % 0.13/0.37 cnf(i_0_68, plain, (natargument(f_relationexistsallfn(X1,X2,X3,X4),n_4,X4))). % 0.13/0.37 cnf(i_0_73, negated_conjecture, (~tptpcol_16_7738(X1)|~tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804))). % 0.13/0.37 cnf(i_0_43, plain, (subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(X1)|~tptp_8_968(X2,X1))). % 0.13/0.37 cnf(i_0_48, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))). % 0.13/0.37 cnf(i_0_28, plain, (correctivelensprescription(X1)|~isa(X1,c_correctivelensprescription))). % 0.13/0.37 cnf(i_0_32, plain, (issuingaprescription(X1)|~isa(X1,c_issuingaprescription))). % 0.13/0.37 cnf(i_0_41, plain, (tptpcol_16_7738(X1)|~isa(X1,c_tptpcol_16_7738))). % 0.13/0.37 cnf(i_0_42, plain, (isa(X1,c_tptpcol_16_7738)|~tptpcol_16_7738(X1))). % 0.13/0.37 cnf(i_0_33, plain, (isa(X1,c_issuingaprescription)|~issuingaprescription(X1))). % 0.13/0.37 cnf(i_0_29, plain, (isa(X1,c_correctivelensprescription)|~correctivelensprescription(X1))). % 0.13/0.37 cnf(i_0_49, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))). % 0.13/0.37 cnf(i_0_45, plain, (collection(X1)|~relationexistsall(X2,X3,X1))). % 0.13/0.37 cnf(i_0_46, plain, (collection(X1)|~relationexistsall(X2,X1,X3))). % 0.13/0.37 cnf(i_0_12, plain, (predicate(X1)|~genlpreds(X2,X1))). % 0.13/0.37 cnf(i_0_44, plain, (tptpcol_7_7172(X1)|~tptp_8_968(X1,X2))). % 0.13/0.37 cnf(i_0_55, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))). % 0.13/0.37 cnf(i_0_14, plain, (predicate(X1)|~genlpreds(X1,X2))). % 0.13/0.37 cnf(i_0_19, plain, (binarypredicate(X1)|~genlinverse(X2,X1))). % 0.13/0.37 cnf(i_0_61, plain, (genlmt(X1,X1)|~microtheory(X1))). % 0.13/0.37 cnf(i_0_20, plain, (binarypredicate(X1)|~genlinverse(X1,X2))). % 0.13/0.37 cnf(i_0_50, plain, (collection(X1)|~isa(X2,X1))). % 0.13/0.37 cnf(i_0_23, plain, (collection(X1)|~disjointwith(X2,X1))). % 0.13/0.37 cnf(i_0_24, plain, (collection(X1)|~disjointwith(X1,X2))). % 0.13/0.37 cnf(i_0_30, plain, (artifact(X1)|~products(X2,X1))). % 0.13/0.37 cnf(i_0_31, plain, (creationordestructionevent(X1)|~products(X1,X2))). % 0.13/0.37 cnf(i_0_52, plain, (thing(X1)|~isa(X1,X2))). % 0.13/0.37 cnf(i_0_17, plain, (genlpreds(X1,X1)|~predicate(X1))). % 0.13/0.37 cnf(i_0_56, plain, (microtheory(X1)|~genlmt(X2,X1))). % 0.13/0.37 cnf(i_0_58, plain, (microtheory(X1)|~genlmt(X1,X2))). % 0.13/0.37 cnf(i_0_70, plain, (positiveinteger(X1)|~resultisaarg(X2,X1))). % 0.13/0.37 cnf(i_0_71, plain, (function_denotational(X1)|~resultisaarg(X1,X2))). % 0.13/0.37 cnf(i_0_39, plain, (subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(X1)|~isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))). % 0.13/0.37 cnf(i_0_47, plain, (binarypredicate(X1)|~relationexistsall(X1,X2,X3))). % 0.13/0.37 cnf(i_0_25, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))). % 0.13/0.37 cnf(i_0_10, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))). % 0.13/0.37 cnf(i_0_40, plain, (isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))|~subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription(X1))). % 0.13/0.37 cnf(i_0_54, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))). % 0.13/0.37 cnf(i_0_60, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))). % 0.13/0.37 cnf(i_0_27, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))). % 0.13/0.37 cnf(i_0_26, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))). % 0.13/0.37 cnf(i_0_21, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))). % 0.13/0.37 cnf(i_0_22, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))). % 0.13/0.37 cnf(i_0_11, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))). % 0.13/0.37 cnf(i_0_16, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))). % 0.13/0.37 cnf(i_0_1, plain, (isa(f_relationexistsallfn(X1,X2,X3,X4),X3)|~relationexistsall(X2,X3,X4)|~isa(X1,X4))). % 0.13/0.37 cnf(i_0_6, plain, (tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)|~isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_74, negated_conjecture, (mtvisible(c_knowledgefragmentd3mt)), inference(start_rule)). % 0.13/0.37 cnf(i_0_77, plain, (mtvisible(c_knowledgefragmentd3mt)), inference(extension_rule, [i_0_55])). % 0.13/0.37 cnf(i_0_308, plain, (~genlmt(c_knowledgefragmentd3mt,c_basekb)), inference(closure_rule, [i_0_3])). % 0.13/0.37 cnf(i_0_306, plain, (mtvisible(c_basekb)), inference(extension_rule, [i_0_55])). % 0.13/0.37 cnf(i_0_409, plain, (~genlmt(c_basekb,c_universalvocabularymt)), inference(closure_rule, [i_0_5])). % 0.13/0.37 cnf(i_0_407, plain, (mtvisible(c_universalvocabularymt)), inference(etableau_closure_rule, [i_0_407, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 3 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------