%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.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 : n021.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 : Mon Jul 18 17:45:16 EDT 2022 % Result : Theorem 1.65s 0.61s % Output : CNFRefutation 1.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n021.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Mon Jun 13 03:15:41 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.40 # No SInE strategy applied % 0.15/0.40 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.40 # % 0.15/0.40 # Presaturation interreduction done % 0.15/0.40 # Number of axioms: 82 Number of unprocessed: 82 % 0.15/0.40 # Tableaux proof search. % 0.15/0.40 # APR header successfully linked. % 0.15/0.40 # Hello from C++ % 0.15/0.40 # The folding up rule is enabled... % 0.15/0.40 # Local unification is enabled... % 0.15/0.40 # Any saturation attempts will use folding labels... % 0.15/0.40 # 82 beginning clauses after preprocessing and clausification % 0.15/0.40 # Creating start rules for all 3 conjectures. % 0.15/0.40 # There are 3 start rule candidates: % 0.15/0.40 # Found 13 unit axioms. % 0.15/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.40 # 3 start rule tableaux created. % 0.15/0.40 # 69 extension rule candidate clauses % 0.15/0.40 # 13 unit axiom clauses % 0.15/0.40 % 0.15/0.40 # Requested 8, 32 cores available to the main process. % 0.15/0.40 # There are not enough tableaux to fork, creating more from the initial 3 % 0.15/0.40 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.15/0.40 # We now have 12 tableaux to operate on % 1.65/0.61 # There were 1 total branch saturation attempts. % 1.65/0.61 # There were 0 of these attempts blocked. % 1.65/0.61 # There were 0 deferred branch saturation attempts. % 1.65/0.61 # There were 0 free duplicated saturations. % 1.65/0.61 # There were 1 total successful branch saturations. % 1.65/0.61 # There were 0 successful branch saturations in interreduction. % 1.65/0.61 # There were 0 successful branch saturations on the branch. % 1.65/0.61 # There were 1 successful branch saturations after the branch. % 1.65/0.61 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.65/0.61 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.65/0.61 # Begin clausification derivation % 1.65/0.61 % 1.65/0.61 # End clausification derivation % 1.65/0.61 # Begin listing active clauses obtained from FOF to CNF conversion % 1.65/0.61 cnf(i_0_82, negated_conjecture, (occurrence_of(esk16_0,tptp0))). % 1.65/0.61 cnf(i_0_73, plain, (atomic(tptp3))). % 1.65/0.61 cnf(i_0_70, plain, (atomic(tptp4))). % 1.65/0.61 cnf(i_0_71, plain, (atomic(tptp2))). % 1.65/0.61 cnf(i_0_72, plain, (atomic(tptp1))). % 1.65/0.61 cnf(i_0_68, plain, (activity(tptp0))). % 1.65/0.61 cnf(i_0_77, plain, (tptp2!=tptp3)). % 1.65/0.61 cnf(i_0_78, plain, (tptp1!=tptp3)). % 1.65/0.61 cnf(i_0_79, plain, (tptp1!=tptp2)). % 1.65/0.61 cnf(i_0_74, plain, (tptp4!=tptp3)). % 1.65/0.61 cnf(i_0_75, plain, (tptp4!=tptp2)). % 1.65/0.61 cnf(i_0_76, plain, (tptp4!=tptp1)). % 1.65/0.61 cnf(i_0_69, plain, (~atomic(tptp0))). % 1.65/0.61 cnf(i_0_22, plain, (arboreal(X1)|~legal(X1))). % 1.65/0.61 cnf(i_0_67, plain, (occurrence_of(esk13_1(X1),tptp3)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_40, plain, (subactivity_occurrence(X1,X2)|~root_occ(X1,X2))). % 1.65/0.61 cnf(i_0_21, plain, (activity(esk5_1(X1))|~activity_occurrence(X1))). % 1.65/0.61 cnf(i_0_36, plain, (subactivity_occurrence(X1,X2)|~leaf_occ(X1,X2))). % 1.65/0.61 cnf(i_0_42, plain, (~earlier(X1,X2)|~earlier(X2,X1))). % 1.65/0.61 cnf(i_0_50, plain, (arboreal(X1)|~next_subocc(X2,X1,X3))). % 1.65/0.61 cnf(i_0_51, plain, (arboreal(X1)|~next_subocc(X1,X2,X3))). % 1.65/0.61 cnf(i_0_46, plain, (~min_precedes(X1,X2,X3)|~root(X2,X3))). % 1.65/0.61 cnf(i_0_6, plain, (activity(X1)|~occurrence_of(X2,X1))). % 1.65/0.61 cnf(i_0_5, plain, (activity_occurrence(X1)|~occurrence_of(X1,X2))). % 1.65/0.61 cnf(i_0_65, plain, (occurrence_of(esk14_1(X1),tptp4)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_66, plain, (root_occ(esk13_1(X1),X1)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_61, plain, (leaf_occ(esk15_1(X1),X1)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_18, plain, (activity_occurrence(X1)|~subactivity_occurrence(X2,X1))). % 1.65/0.61 cnf(i_0_20, plain, (occurrence_of(X1,esk5_1(X1))|~activity_occurrence(X1))). % 1.65/0.61 cnf(i_0_29, plain, (~leaf(X1,X2)|~min_precedes(X1,X3,X2))). % 1.65/0.61 cnf(i_0_45, plain, (earlier(X1,X2)|~precedes(X1,X2))). % 1.65/0.61 cnf(i_0_19, plain, (activity_occurrence(X1)|~subactivity_occurrence(X1,X2))). % 1.65/0.61 cnf(i_0_33, plain, (legal(X1)|~root(X1,X2))). % 1.65/0.61 cnf(i_0_44, plain, (legal(X1)|~precedes(X2,X1))). % 1.65/0.61 cnf(i_0_81, negated_conjecture, (~min_precedes(X1,X2,tptp0)|~leaf_occ(X2,esk16_0)|~root_occ(X1,esk16_0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp2))). % 1.65/0.61 cnf(i_0_80, negated_conjecture, (~min_precedes(X1,X2,tptp0)|~leaf_occ(X2,esk16_0)|~root_occ(X1,esk16_0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp1))). % 1.65/0.61 cnf(i_0_63, plain, (occurrence_of(esk15_1(X1),tptp1)|occurrence_of(esk15_1(X1),tptp2)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_55, plain, (min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3))). % 1.65/0.61 cnf(i_0_32, plain, (atomic(X1)|~arboreal(X2)|~occurrence_of(X2,X1))). % 1.65/0.61 cnf(i_0_25, plain, (atomic(esk6_2(X1,X2))|~atocc(X1,X2))). % 1.65/0.61 cnf(i_0_31, plain, (arboreal(X1)|~atomic(X2)|~occurrence_of(X1,X2))). % 1.65/0.61 cnf(i_0_49, plain, (precedes(X1,X2)|~min_precedes(X1,X2,X3))). % 1.65/0.61 cnf(i_0_17, plain, (~min_precedes(X1,X2,X3)|~root_occ(X2,X4)|~occurrence_of(X4,X3))). % 1.65/0.61 cnf(i_0_16, plain, (~min_precedes(X1,X2,X3)|~leaf_occ(X1,X4)|~occurrence_of(X4,X3))). % 1.65/0.61 cnf(i_0_37, plain, (occurrence_of(X1,esk9_2(X2,X1))|~leaf_occ(X2,X1))). % 1.65/0.61 cnf(i_0_15, plain, (X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1))). % 1.65/0.61 cnf(i_0_41, plain, (occurrence_of(X1,esk10_2(X2,X1))|~root_occ(X2,X1))). % 1.65/0.61 cnf(i_0_24, plain, (occurrence_of(X1,esk6_2(X1,X2))|~atocc(X1,X2))). % 1.65/0.61 cnf(i_0_64, plain, (next_subocc(esk13_1(X1),esk14_1(X1),tptp0)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_43, plain, (precedes(X1,X2)|~earlier(X1,X2)|~legal(X2))). % 1.65/0.61 cnf(i_0_39, plain, (root(X1,esk10_2(X1,X2))|~root_occ(X1,X2))). % 1.65/0.61 cnf(i_0_54, plain, (~next_subocc(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3))). % 1.65/0.61 cnf(i_0_59, plain, (earlier(X1,X2)|~earlier(X3,X2)|~earlier(X1,X3))). % 1.65/0.61 cnf(i_0_26, plain, (subactivity(X1,esk6_2(X2,X1))|~atocc(X2,X1))). % 1.65/0.61 cnf(i_0_8, plain, (atocc(X1,esk2_2(X2,X1))|~root(X1,X2))). % 1.65/0.61 cnf(i_0_35, plain, (leaf(X1,esk9_2(X1,X2))|~leaf_occ(X1,X2))). % 1.65/0.61 cnf(i_0_62, plain, (next_subocc(esk14_1(X1),esk15_1(X1),tptp0)|~occurrence_of(X1,tptp0))). % 1.65/0.61 cnf(i_0_58, plain, (X1=X2|~root_occ(X2,X3)|~root_occ(X1,X3)|~occurrence_of(X3,X4))). % 1.65/0.61 cnf(i_0_9, plain, (subactivity(esk2_2(X1,X2),X1)|~root(X2,X1))). % 1.65/0.61 cnf(i_0_12, plain, (occurrence_of(esk3_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))). % 1.65/0.61 cnf(i_0_23, plain, (atocc(X1,X2)|~subactivity(X2,X3)|~atomic(X3)|~occurrence_of(X1,X3))). % 1.65/0.61 cnf(i_0_13, plain, (leaf_occ(X1,esk4_2(X1,X2))|atomic(X2)|~leaf(X1,X2))). % 1.65/0.61 cnf(i_0_38, plain, (root_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~root(X1,X3)|~occurrence_of(X2,X3))). % 1.65/0.61 cnf(i_0_34, plain, (leaf_occ(X1,X2)|~leaf(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))). % 1.65/0.61 cnf(i_0_10, plain, (subactivity_occurrence(X1,esk3_3(X2,X3,X1))|~min_precedes(X3,X1,X2))). % 1.65/0.61 cnf(i_0_11, plain, (subactivity_occurrence(X1,esk3_3(X2,X1,X3))|~min_precedes(X1,X3,X2))). % 1.65/0.61 cnf(i_0_14, plain, (atomic(X1)|occurrence_of(esk4_2(X2,X1),X1)|~leaf(X2,X1))). % 1.65/0.61 cnf(i_0_2, plain, (root(esk1_2(X1,X2),X1)|atomic(X1)|~occurrence_of(X2,X1))). % 1.65/0.61 cnf(i_0_1, plain, (subactivity_occurrence(esk1_2(X1,X2),X2)|atomic(X1)|~occurrence_of(X2,X1))). % 1.65/0.61 cnf(i_0_48, plain, (root(esk11_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))). % 1.65/0.61 cnf(i_0_47, plain, (min_precedes(esk11_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))). % 1.65/0.61 cnf(i_0_57, plain, (X1=X2|atomic(X3)|~leaf_occ(X2,X4)|~leaf_occ(X1,X4)|~occurrence_of(X4,X3))). % 1.65/0.61 cnf(i_0_28, plain, (leaf(X1,X2)|min_precedes(X1,esk8_2(X1,X2),X2)|~root(X1,X2))). % 1.65/0.61 cnf(i_0_56, plain, (subactivity_occurrence(X1,X2)|~min_precedes(X1,X3,X4)|~subactivity_occurrence(X3,X2)|~occurrence_of(X2,X4))). % 1.65/0.61 cnf(i_0_30, plain, (min_precedes(esk7_2(X1,X2),X1,X2)|root(X1,X2)|~leaf(X1,X2))). % 1.65/0.61 cnf(i_0_60, plain, (min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X4,X2,X3)|~min_precedes(X4,X1,X3))). % 1.65/0.61 cnf(i_0_27, plain, (leaf(X1,X2)|min_precedes(X1,esk8_2(X1,X2),X2)|~min_precedes(X3,X1,X2))). % 1.65/0.61 cnf(i_0_53, plain, (next_subocc(X1,X2,X3)|min_precedes(X1,esk12_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))). % 1.65/0.61 cnf(i_0_52, plain, (next_subocc(X1,X2,X3)|min_precedes(esk12_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))). % 1.65/0.61 cnf(i_0_4, plain, (X1=X2|min_precedes(X1,X2,X3)|~arboreal(X1)|~leaf_occ(X2,X4)|~subactivity_occurrence(X1,X4)|~occurrence_of(X4,X3))). % 1.65/0.61 cnf(i_0_3, plain, (X1=X2|min_precedes(X2,X1,X3)|~min_precedes(X4,X2,X3)|~leaf_occ(X1,X5)|~root_occ(X4,X5)|~subactivity_occurrence(X2,X5)|~occurrence_of(X5,X3))). % 1.65/0.61 cnf(i_0_7, plain, (X1=X2|min_precedes(X1,X2,X3)|min_precedes(X2,X1,X3)|~arboreal(X2)|~arboreal(X1)|~subactivity_occurrence(X2,X4)|~subactivity_occurrence(X1,X4)|~occurrence_of(X4,X3))). % 1.65/0.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.65/0.61 # Begin printing tableau % 1.65/0.61 # Found 4 steps % 1.65/0.61 cnf(i_0_82, negated_conjecture, (occurrence_of(esk16_0,tptp0)), inference(start_rule)). % 1.65/0.61 cnf(i_0_93, plain, (occurrence_of(esk16_0,tptp0)), inference(extension_rule, [i_0_67])). % 1.65/0.61 cnf(i_0_288, plain, (occurrence_of(esk13_1(esk16_0),tptp3)), inference(extension_rule, [i_0_6])). % 1.65/0.61 cnf(i_0_306, plain, (activity(tptp3)), inference(etableau_closure_rule, [i_0_306, ...])). % 1.65/0.61 # End printing tableau % 1.65/0.61 # SZS output end % 1.65/0.61 # Branches closed with saturation will be marked with an "s" % 1.65/0.61 # Child (26147) has found a proof. % 1.65/0.61 % 1.65/0.61 # Proof search is over... % 1.65/0.61 # Freeing feature tree %------------------------------------------------------------------------------