%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET671+3 : TPTP v8.1.0. Released v2.2.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 : n010.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 : Tue Jul 19 01:01:54 EDT 2022 % Result : Theorem 0.20s 0.48s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SET671+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n010.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 : 600 % 0.13/0.35 % DateTime : Sat Jul 9 20:40:45 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 55 Number of unprocessed: 41 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 41 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 3 conjectures. % 0.13/0.38 # There are 3 start rule candidates: % 0.13/0.38 # Found 9 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 3 start rule tableaux created. % 0.13/0.38 # 32 extension rule candidate clauses % 0.13/0.38 # 9 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 8 tableaux to operate on % 0.20/0.48 # There were 4 total branch saturation attempts. % 0.20/0.48 # There were 0 of these attempts blocked. % 0.20/0.48 # There were 0 deferred branch saturation attempts. % 0.20/0.48 # There were 0 free duplicated saturations. % 0.20/0.48 # There were 4 total successful branch saturations. % 0.20/0.48 # There were 0 successful branch saturations in interreduction. % 0.20/0.48 # There were 0 successful branch saturations on the branch. % 0.20/0.48 # There were 4 successful branch saturations after the branch. % 0.20/0.48 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.48 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.48 # Begin clausification derivation % 0.20/0.48 % 0.20/0.48 # End clausification derivation % 0.20/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.48 cnf(i_0_56, negated_conjecture, (subset(esk14_0,esk15_0))). % 0.20/0.48 cnf(i_0_25, plain, (ilf_type(esk5_0,binary_relation_type))). % 0.20/0.48 cnf(i_0_54, plain, (ilf_type(X1,set_type))). % 0.20/0.48 cnf(i_0_31, plain, (subset(X1,X1))). % 0.20/0.48 cnf(i_0_57, negated_conjecture, (ilf_type(esk16_0,relation_type(esk14_0,esk13_0)))). % 0.20/0.48 cnf(i_0_28, plain, (ilf_type(esk6_1(X1),subset_type(X1)))). % 0.20/0.48 cnf(i_0_14, plain, (ilf_type(esk3_2(X1,X2),relation_type(X2,X1)))). % 0.20/0.48 cnf(i_0_55, negated_conjecture, (restrict4(esk14_0,esk13_0,esk16_0,esk15_0)!=esk16_0)). % 0.20/0.48 cnf(i_0_37, plain, (~empty(power_set(X1)))). % 0.20/0.48 cnf(i_0_51, plain, (relation_like(X1)|~empty(X1))). % 0.20/0.48 cnf(i_0_24, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))). % 0.20/0.48 cnf(i_0_22, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))). % 0.20/0.48 cnf(i_0_42, plain, (relation_like(X1)|member(esk11_1(X1),X1))). % 0.20/0.48 cnf(i_0_50, plain, (~empty(X1)|~member(X2,X1))). % 0.20/0.48 cnf(i_0_48, plain, (empty(X1)|member(esk12_1(X1),X1))). % 0.20/0.48 cnf(i_0_15, plain, (subset(X1,X2)|~member(esk4_2(X1,X2),X2))). % 0.20/0.48 cnf(i_0_47, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.20/0.48 cnf(i_0_21, plain, (ilf_type(restrict(X1,X2),binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.48 cnf(i_0_26, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.20/0.48 cnf(i_0_40, plain, (empty(X1)|ilf_type(esk8_1(X1),member_type(X1)))). % 0.20/0.48 cnf(i_0_32, plain, (member(X1,power_set(X2))|~member(esk7_2(X1,X2),X2))). % 0.20/0.48 cnf(i_0_41, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))). % 0.20/0.48 cnf(i_0_39, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.20/0.48 cnf(i_0_13, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.20/0.48 cnf(i_0_27, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.20/0.48 cnf(i_0_38, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.20/0.48 cnf(i_0_16, plain, (subset(X1,X2)|member(esk4_2(X1,X2),X1))). % 0.20/0.48 cnf(i_0_18, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.20/0.48 cnf(i_0_35, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.20/0.48 cnf(i_0_9, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),restrict(X4,X2))|~ilf_type(X4,binary_relation_type))). % 0.20/0.48 cnf(i_0_33, plain, (member(esk7_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.20/0.48 cnf(i_0_12, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 0.20/0.48 cnf(i_0_52, plain, (restrict4(X1,X2,X3,X4)=restrict(X3,X4)|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.48 cnf(i_0_53, plain, (ilf_type(restrict4(X1,X2,X3,X4),relation_type(X1,X2))|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.48 cnf(i_0_8, plain, (member(ordered_pair(X1,X2),X3)|~member(ordered_pair(X1,X2),restrict(X3,X4))|~ilf_type(X3,binary_relation_type))). % 0.20/0.48 cnf(i_0_44, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.20/0.48 cnf(i_0_10, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))). % 0.20/0.48 cnf(i_0_11, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))). % 0.20/0.48 cnf(i_0_2, plain, (X1=X2|~member(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X2)|~member(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.48 cnf(i_0_7, plain, (member(ordered_pair(X1,X2),restrict(X3,X4))|~member(ordered_pair(X1,X2),X3)|~member(X1,X4)|~ilf_type(X3,binary_relation_type))). % 0.20/0.48 cnf(i_0_1, plain, (X1=X2|member(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)|member(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.48 # Begin printing tableau % 0.20/0.48 # Found 7 steps % 0.20/0.48 cnf(i_0_55, negated_conjecture, (restrict4(esk14_0,esk13_0,esk16_0,esk15_0)!=esk16_0), inference(start_rule)). % 0.20/0.48 cnf(i_0_61, plain, (restrict4(esk14_0,esk13_0,esk16_0,esk15_0)!=esk16_0), inference(extension_rule, [i_0_1])). % 0.20/0.48 cnf(i_0_140, plain, (member(ordered_pair(esk1_2(restrict4(esk14_0,esk13_0,esk16_0,esk15_0),esk16_0),esk2_2(restrict4(esk14_0,esk13_0,esk16_0,esk15_0),esk16_0)),restrict4(esk14_0,esk13_0,esk16_0,esk15_0))), inference(extension_rule, [i_0_50])). % 0.20/0.48 cnf(i_0_141, plain, (member(ordered_pair(esk1_2(restrict4(esk14_0,esk13_0,esk16_0,esk15_0),esk16_0),esk2_2(restrict4(esk14_0,esk13_0,esk16_0,esk15_0),esk16_0)),esk16_0)), inference(etableau_closure_rule, [i_0_141, ...])). % 0.20/0.48 cnf(i_0_142, plain, (~ilf_type(esk16_0,binary_relation_type)), inference(etableau_closure_rule, [i_0_142, ...])). % 0.20/0.48 cnf(i_0_143, plain, (~ilf_type(restrict4(esk14_0,esk13_0,esk16_0,esk15_0),binary_relation_type)), inference(etableau_closure_rule, [i_0_143, ...])). % 0.20/0.48 cnf(i_0_312, plain, (~empty(restrict4(esk14_0,esk13_0,esk16_0,esk15_0))), inference(etableau_closure_rule, [i_0_312, ...])). % 0.20/0.48 # End printing tableau % 0.20/0.48 # SZS output end % 0.20/0.48 # Branches closed with saturation will be marked with an "s" % 0.20/0.48 # Child (7087) has found a proof. % 0.20/0.48 % 0.20/0.48 # Proof search is over... % 0.20/0.48 # Freeing feature tree %------------------------------------------------------------------------------