%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET665+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 : n019.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:51 EDT 2022 % Result : Theorem 0.19s 0.38s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET665+3 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n019.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 02:20:53 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 62 Number of unprocessed: 42 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 42 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 9 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 33 extension rule candidate clauses % 0.12/0.37 # 9 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.38 # There were 2 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 2 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 2 successful branch saturations after the branch. % 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_61, plain, (ilf_type(X1,set_type))). % 0.19/0.38 cnf(i_0_32, plain, (ilf_type(esk6_0,binary_relation_type))). % 0.19/0.38 cnf(i_0_36, plain, (subset(X1,X1))). % 0.19/0.38 cnf(i_0_23, plain, (ilf_type(identity_relation_of(X1),binary_relation_type))). % 0.19/0.38 cnf(i_0_40, plain, (ilf_type(esk8_1(X1),subset_type(X1)))). % 0.19/0.38 cnf(i_0_12, plain, (ilf_type(cross_product(X1,X2),relation_type(X1,X2)))). % 0.19/0.38 cnf(i_0_35, plain, (ilf_type(esk7_2(X1,X2),relation_type(X2,X1)))). % 0.19/0.38 cnf(i_0_62, negated_conjecture, (~subset(identity_relation_of(esk15_0),cross_product(esk15_0,esk15_0)))). % 0.19/0.38 cnf(i_0_53, plain, (~empty(power_set(X1)))). % 0.19/0.38 cnf(i_0_60, plain, (relation_like(X1)|~empty(X1))). % 0.19/0.38 cnf(i_0_31, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))). % 0.19/0.38 cnf(i_0_29, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))). % 0.19/0.38 cnf(i_0_59, plain, (~empty(X1)|~member(X2,X1))). % 0.19/0.38 cnf(i_0_42, plain, (relation_like(X1)|member(esk11_1(X1),X1))). % 0.19/0.38 cnf(i_0_57, plain, (empty(X1)|member(esk14_1(X1),X1))). % 0.19/0.38 cnf(i_0_24, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))). % 0.19/0.38 cnf(i_0_47, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.19/0.38 cnf(i_0_48, plain, (member(X1,power_set(X2))|~member(esk12_2(X1,X2),X2))). % 0.19/0.38 cnf(i_0_38, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.19/0.38 cnf(i_0_56, plain, (empty(X1)|ilf_type(esk13_1(X1),member_type(X1)))). % 0.19/0.38 cnf(i_0_54, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.19/0.38 cnf(i_0_41, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))). % 0.19/0.38 cnf(i_0_55, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.19/0.38 cnf(i_0_7, plain, (X1=X2|~member(ordered_pair(X1,X2),identity_relation_of(X3)))). % 0.19/0.38 cnf(i_0_39, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.19/0.38 cnf(i_0_25, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))). % 0.19/0.38 cnf(i_0_8, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),identity_relation_of(X2)))). % 0.19/0.38 cnf(i_0_34, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.19/0.38 cnf(i_0_1, plain, (subset(X1,X2)|~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.19/0.38 cnf(i_0_49, plain, (member(esk12_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.19/0.38 cnf(i_0_33, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))). % 0.19/0.38 cnf(i_0_27, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.19/0.38 cnf(i_0_51, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.19/0.38 cnf(i_0_10, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),cross_product(X4,X2)))). % 0.19/0.38 cnf(i_0_11, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),cross_product(X2,X4)))). % 0.19/0.38 cnf(i_0_16, plain, (member(esk3_3(X1,X2,X3),X1)|~member(X3,cross_product(X1,X2)))). % 0.19/0.38 cnf(i_0_15, plain, (member(esk4_3(X1,X2,X3),X2)|~member(X3,cross_product(X1,X2)))). % 0.19/0.38 cnf(i_0_6, plain, (member(ordered_pair(X1,X1),identity_relation_of(X2))|~member(X1,X2))). % 0.19/0.38 cnf(i_0_44, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.19/0.38 cnf(i_0_9, plain, (member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3))). % 0.19/0.38 cnf(i_0_2, plain, (member(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)|subset(X1,X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.19/0.38 cnf(i_0_14, plain, (ordered_pair(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))=X3|~member(X3,cross_product(X1,X2)))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 6 steps % 0.19/0.38 cnf(i_0_62, negated_conjecture, (~subset(identity_relation_of(esk15_0),cross_product(esk15_0,esk15_0))), inference(start_rule)). % 0.19/0.38 cnf(i_0_67, plain, (~subset(identity_relation_of(esk15_0),cross_product(esk15_0,esk15_0))), inference(extension_rule, [i_0_2])). % 0.19/0.38 cnf(i_0_140, plain, (~ilf_type(identity_relation_of(esk15_0),binary_relation_type)), inference(closure_rule, [i_0_23])). % 0.19/0.38 cnf(i_0_137, plain, (member(ordered_pair(esk1_2(identity_relation_of(esk15_0),cross_product(esk15_0,esk15_0)),esk2_2(identity_relation_of(esk15_0),cross_product(esk15_0,esk15_0))),identity_relation_of(esk15_0))), inference(extension_rule, [i_0_59])). % 0.19/0.38 cnf(i_0_139, plain, (~ilf_type(cross_product(esk15_0,esk15_0),binary_relation_type)), inference(etableau_closure_rule, [i_0_139, ...])). % 0.19/0.38 cnf(i_0_149, plain, (~empty(identity_relation_of(esk15_0))), inference(etableau_closure_rule, [i_0_149, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.19/0.38 # We now have 4 tableaux to operate on % 0.19/0.38 # Found closed tableau during pool population. % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------