%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET668+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:52 EDT 2022 % Result : Theorem 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SET668+3 : TPTP v8.1.0. Released v2.2.0. % 0.12/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 10:43:07 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y % 0.12/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.38 # % 0.12/0.38 # Number of axioms: 64 Number of unprocessed: 64 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 64 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 5 conjectures. % 0.12/0.38 # There are 5 start rule candidates: % 0.12/0.38 # Found 6 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 5 start rule tableaux created. % 0.12/0.38 # 58 extension rule candidate clauses % 0.12/0.38 # 6 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 5 % 0.12/0.38 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 17 tableaux to operate on % 0.20/0.42 # There were 4 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 4 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 4 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_30, plain, (ilf_type(esk5_0,binary_relation_type))). % 0.20/0.42 cnf(i_0_65, negated_conjecture, (ilf_type(esk13_0,set_type))). % 0.20/0.42 cnf(i_0_64, negated_conjecture, (ilf_type(esk14_0,set_type))). % 0.20/0.42 cnf(i_0_60, plain, (ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_62, negated_conjecture, (subset(identity_relation_of(esk14_0),esk15_0))). % 0.20/0.42 cnf(i_0_55, plain, (relation_like(X1)|~empty(X1)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_63, negated_conjecture, (ilf_type(esk15_0,relation_type(esk14_0,esk13_0)))). % 0.20/0.42 cnf(i_0_34, plain, (subset(X1,X1)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_35, plain, (subset(X1,X1)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_41, plain, (~empty(power_set(X1))|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_7, plain, (ilf_type(identity_relation_of(X1),binary_relation_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_23, plain, (ilf_type(domain_of(X1),set_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_25, plain, (ilf_type(range_of(X1),set_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_40, plain, (ilf_type(power_set(X1),set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_27, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_47, plain, (relation_like(X1)|ilf_type(esk11_1(X1),set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_53, plain, (empty(X1)|ilf_type(esk12_1(X1),set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_29, plain, (relation_like(X1)|~ilf_type(X1,set_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_46, plain, (relation_like(X1)|member(esk11_1(X1),X1)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_52, plain, (empty(X1)|member(esk12_1(X1),X1)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_33, plain, (ilf_type(esk6_1(X1),subset_type(X1))|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_44, plain, (empty(X1)|ilf_type(esk8_1(X1),member_type(X1))|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_21, plain, (subset(X1,X2)|X1!=X2|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_22, plain, (subset(X1,X2)|X1!=X2|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_54, plain, (~empty(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_26, plain, (ilf_type(ordered_pair(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_24, plain, (ilf_type(cross_product(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_1, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_20, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_42, plain, (empty(X2)|ilf_type(X1,member_type(X2))|~member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_43, plain, (empty(X2)|member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(X2)))). % 0.20/0.42 cnf(i_0_13, plain, (subset(X1,X2)|ilf_type(esk2_2(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_18, plain, (subset(X1,X2)|ilf_type(esk3_2(X1,X2),set_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_17, plain, (subset(X1,X2)|ilf_type(esk4_2(X1,X2),set_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_45, plain, (relation_like(X3)|esk11_1(X3)!=ordered_pair(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_12, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_38, plain, (member(X1,power_set(X2))|ilf_type(esk7_2(X1,X2),set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_37, plain, (member(X1,power_set(X2))|member(esk7_2(X1,X2),X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_32, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,subset_type(X2)))). % 0.20/0.42 cnf(i_0_10, plain, (ilf_type(esk1_2(X1,X2),relation_type(X2,X1))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_50, plain, (ilf_type(esk9_2(X1,X2),set_type)|~relation_like(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_49, plain, (ilf_type(esk10_2(X1,X2),set_type)|~relation_like(X1)|~member(X2,X1)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_31, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(power_set(X2))))). % 0.20/0.42 cnf(i_0_11, plain, (subset(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(esk2_2(X1,X2),X2))). % 0.20/0.42 cnf(i_0_14, plain, (member(X3,X2)|~subset(X1,X2)|~member(X3,X1)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_36, plain, (member(X1,power_set(X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(esk7_2(X1,X2),X2))). % 0.20/0.42 cnf(i_0_39, plain, (member(X3,X2)|~member(X3,X1)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,power_set(X2)))). % 0.20/0.42 cnf(i_0_4, plain, (member(ordered_pair(X1,X3),identity_relation_of(X2))|X1!=X3|~member(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_5, plain, (X1=X2|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),identity_relation_of(X3)))). % 0.20/0.42 cnf(i_0_48, plain, (ordered_pair(esk9_2(X2,X1),esk10_2(X2,X1))=X1|~relation_like(X2)|~member(X1,X2)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type))). % 0.20/0.42 cnf(i_0_6, plain, (member(X1,X2)|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X3),identity_relation_of(X2)))). % 0.20/0.42 cnf(i_0_51, plain, (relation_like(X3)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2))))). % 0.20/0.42 cnf(i_0_56, plain, (domain(X1,X2,X3)=domain_of(X3)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.42 cnf(i_0_58, plain, (range(X1,X2,X3)=range_of(X3)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.42 cnf(i_0_8, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,relation_type(X2,X3)))). % 0.20/0.42 cnf(i_0_9, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,subset_type(cross_product(X2,X3))))). % 0.20/0.42 cnf(i_0_16, plain, (subset(X1,X2)|member(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))). % 0.20/0.42 cnf(i_0_19, plain, (member(ordered_pair(X3,X4),X2)|~subset(X1,X2)|~ilf_type(X4,set_type)|~ilf_type(X3,set_type)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type)|~member(ordered_pair(X3,X4),X1))). % 0.20/0.42 cnf(i_0_57, plain, (ilf_type(domain(X1,X2,X3),subset_type(X1))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.42 cnf(i_0_59, plain, (ilf_type(range(X1,X2,X3),subset_type(X2))|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2)))). % 0.20/0.42 cnf(i_0_61, negated_conjecture, (domain(esk14_0,esk13_0,esk15_0)!=esk14_0|~subset(esk14_0,range(esk14_0,esk13_0,esk15_0)))). % 0.20/0.42 cnf(i_0_3, plain, (subset(X1,domain(X2,X3,X4))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~subset(identity_relation_of(X1),X4)|~ilf_type(X4,relation_type(X2,X3)))). % 0.20/0.42 cnf(i_0_2, plain, (subset(X1,range(X2,X3,X4))|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~subset(identity_relation_of(X1),X4)|~ilf_type(X4,relation_type(X2,X3)))). % 0.20/0.42 cnf(i_0_15, plain, (subset(X1,X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type)|~member(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X2))). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 15 steps % 0.20/0.42 cnf(i_0_61, negated_conjecture, (domain(esk14_0,esk13_0,esk15_0)!=esk14_0|~subset(esk14_0,range(esk14_0,esk13_0,esk15_0))), inference(start_rule)). % 0.20/0.42 cnf(i_0_67, plain, (~subset(esk14_0,range(esk14_0,esk13_0,esk15_0))), inference(extension_rule, [i_0_2])). % 0.20/0.42 cnf(i_0_513, plain, (~ilf_type(esk13_0,set_type)), inference(closure_rule, [i_0_60])). % 0.20/0.42 cnf(i_0_514, plain, (~ilf_type(esk14_0,set_type)), inference(closure_rule, [i_0_60])). % 0.20/0.42 cnf(i_0_515, plain, (~ilf_type(esk14_0,set_type)), inference(closure_rule, [i_0_60])). % 0.20/0.42 cnf(i_0_516, plain, (~subset(identity_relation_of(esk14_0),esk15_0)), inference(closure_rule, [i_0_62])). % 0.20/0.42 cnf(i_0_517, plain, (~ilf_type(esk15_0,relation_type(esk14_0,esk13_0))), inference(closure_rule, [i_0_63])). % 0.20/0.42 cnf(i_0_66, plain, (domain(esk14_0,esk13_0,esk15_0)!=esk14_0), inference(extension_rule, [i_0_1])). % 0.20/0.42 cnf(i_0_585, plain, (~ilf_type(esk14_0,set_type)), inference(closure_rule, [i_0_60])). % 0.20/0.42 cnf(i_0_586, plain, (~ilf_type(domain(esk14_0,esk13_0,esk15_0),set_type)), inference(closure_rule, [i_0_60])). % 0.20/0.42 cnf(i_0_583, plain, (~subset(esk14_0,domain(esk14_0,esk13_0,esk15_0))), inference(extension_rule, [i_0_18])). % 0.20/0.42 cnf(i_0_584, plain, (~subset(domain(esk14_0,esk13_0,esk15_0),esk14_0)), inference(etableau_closure_rule, [i_0_584, ...])). % 0.20/0.42 cnf(i_0_665, plain, (ilf_type(esk3_2(esk14_0,domain(esk14_0,esk13_0,esk15_0)),set_type)), inference(etableau_closure_rule, [i_0_665, ...])). % 0.20/0.42 cnf(i_0_666, plain, (~ilf_type(domain(esk14_0,esk13_0,esk15_0),binary_relation_type)), inference(etableau_closure_rule, [i_0_666, ...])). % 0.20/0.42 cnf(i_0_667, plain, (~ilf_type(esk14_0,binary_relation_type)), inference(etableau_closure_rule, [i_0_667, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # Child (5970) has found a proof. % 0.20/0.42 % 0.20/0.42 # Proof search is over... % 0.20/0.42 # Freeing feature tree %------------------------------------------------------------------------------