%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET679+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 : n004.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:57 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.04/0.12 % Problem : SET679+3 : TPTP v8.1.0. Released v2.2.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n004.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jul 10 16:08:07 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.19/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 46 Number of unprocessed: 34 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 34 beginning clauses after preprocessing and clausification % 0.19/0.38 # Creating start rules for all 2 conjectures. % 0.19/0.38 # There are 2 start rule candidates: % 0.19/0.38 # Found 11 unit axioms. % 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.38 # 2 start rule tableaux created. % 0.19/0.38 # 23 extension rule candidate clauses % 0.19/0.38 # 11 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.38 # There were 4 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 2 free duplicated saturations. % 0.19/0.38 # There were 4 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_4, plain, (empty(empty_set))). % 0.19/0.38 cnf(i_0_46, plain, (ilf_type(X1,set_type))). % 0.19/0.38 cnf(i_0_24, plain, (ilf_type(esk3_0,binary_relation_type))). % 0.19/0.38 cnf(i_0_5, plain, (type(empty_set,set_type))). % 0.19/0.38 cnf(i_0_9, plain, (ilf_type(identity_relation_of(X1),binary_relation_type))). % 0.19/0.38 cnf(i_0_36, plain, (ilf_type(esk7_1(X1),subset_type(X1)))). % 0.19/0.38 cnf(i_0_49, negated_conjecture, (~empty(esk10_0))). % 0.19/0.38 cnf(i_0_47, negated_conjecture, (~not_equal(identity_relation_of(esk10_0),empty_set))). % 0.19/0.38 cnf(i_0_3, plain, (~member(X1,empty_set))). % 0.19/0.38 cnf(i_0_42, plain, (~empty(power_set(X1)))). % 0.19/0.38 cnf(i_0_16, plain, (~not_equal(X1,X1))). % 0.19/0.38 cnf(i_0_31, plain, (relation_like(X1)|~empty(X1))). % 0.19/0.38 cnf(i_0_21, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))). % 0.19/0.38 cnf(i_0_23, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))). % 0.19/0.38 cnf(i_0_15, plain, (X1=X2|not_equal(X1,X2))). % 0.19/0.38 cnf(i_0_17, plain, (empty(X1)|member(esk2_1(X1),X1))). % 0.19/0.38 cnf(i_0_45, plain, (empty(X1)|ilf_type(esk9_1(X1),member_type(X1)))). % 0.19/0.38 cnf(i_0_26, plain, (relation_like(X1)|member(esk6_1(X1),X1))). % 0.19/0.38 cnf(i_0_19, plain, (~empty(X1)|~member(X2,X1))). % 0.19/0.38 cnf(i_0_43, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))). % 0.19/0.38 cnf(i_0_44, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))). % 0.19/0.38 cnf(i_0_32, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.19/0.38 cnf(i_0_35, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))). % 0.19/0.38 cnf(i_0_34, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))). % 0.19/0.38 cnf(i_0_38, plain, (member(esk8_2(X1,X2),X1)|member(X1,power_set(X2)))). % 0.19/0.38 cnf(i_0_25, plain, (relation_like(X1)|esk6_1(X1)!=ordered_pair(X2,X3))). % 0.19/0.38 cnf(i_0_2, plain, (member(ordered_pair(X1,X1),identity_relation_of(X2))|~member(X1,X2))). % 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_37, plain, (member(X1,power_set(X2))|~member(esk8_2(X1,X2),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_28, plain, (ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))). % 0.19/0.38 cnf(i_0_10, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). % 0.19/0.38 cnf(i_0_40, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))). % 0.19/0.38 cnf(i_0_11, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). % 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_49, negated_conjecture, (~empty(esk10_0)), inference(start_rule)). % 0.19/0.38 cnf(i_0_53, plain, (~empty(esk10_0)), inference(extension_rule, [i_0_44])). % 0.19/0.38 cnf(i_0_124, plain, (member(esk1_2(esk10_0,esk10_0),esk10_0)), inference(extension_rule, [i_0_11])). % 0.19/0.38 cnf(i_0_205, plain, (~member(esk1_2(esk10_0,esk10_0),esk10_0)), inference(closure_rule, [i_0_124])). % 0.19/0.38 cnf(i_0_125, plain, (~ilf_type(esk1_2(esk10_0,esk10_0),member_type(esk10_0))), inference(etableau_closure_rule, [i_0_125, ...])). % 0.19/0.38 cnf(i_0_204, plain, (esk10_0=esk10_0), inference(etableau_closure_rule, [i_0_204, ...])). % 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 9 new_tableaux and 0 remaining starting tableaux. % 0.19/0.38 # We now have 9 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 %------------------------------------------------------------------------------