%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET809+4 : TPTP v8.1.0. Released v3.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 : n029.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:02:46 EDT 2022 % Result : Theorem 0.19s 0.39s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET809+4 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 22:43:31 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 80 Number of unprocessed: 80 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 80 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 6 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 74 extension rule candidate clauses % 0.13/0.37 # 6 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.37 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 25 tableaux to operate on % 0.19/0.39 # There were 2 total branch saturation attempts. % 0.19/0.39 # There were 0 of these attempts blocked. % 0.19/0.39 # There were 0 deferred branch saturation attempts. % 0.19/0.39 # There were 0 free duplicated saturations. % 0.19/0.39 # There were 2 total successful branch saturations. % 0.19/0.39 # There were 0 successful branch saturations in interreduction. % 0.19/0.39 # There were 0 successful branch saturations on the branch. % 0.19/0.39 # There were 2 successful branch saturations after the branch. % 0.19/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.39 # Begin clausification derivation % 0.19/0.39 % 0.19/0.39 # End clausification derivation % 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.39 cnf(i_0_80, negated_conjecture, (member(esk14_0,on))). % 0.19/0.39 cnf(i_0_79, negated_conjecture, (member(esk14_0,esk14_0))). % 0.19/0.39 cnf(i_0_19, plain, (member(X1,singleton(X1)))). % 0.19/0.39 cnf(i_0_21, plain, (member(X1,unordered_pair(X2,X1)))). % 0.19/0.39 cnf(i_0_22, plain, (member(X1,unordered_pair(X1,X2)))). % 0.19/0.39 cnf(i_0_15, plain, (~member(X1,empty_set))). % 0.19/0.39 cnf(i_0_34, plain, (set(X1)|~member(X1,on))). % 0.19/0.39 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))). % 0.19/0.39 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))). % 0.19/0.39 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))). % 0.19/0.39 cnf(i_0_39, plain, (strict_order(X1,X2)|~strict_well_order(X1,X2))). % 0.19/0.39 cnf(i_0_17, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). % 0.19/0.39 cnf(i_0_33, plain, (strict_well_order(member_predicate,X1)|~member(X1,on))). % 0.19/0.39 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))). % 0.19/0.39 cnf(i_0_46, plain, (member(X1,X2)|~apply(member_predicate,X1,X2))). % 0.19/0.39 cnf(i_0_44, plain, (member(X1,X2)|~least(X1,X3,X2))). % 0.19/0.39 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.19/0.39 cnf(i_0_73, plain, (set(X1)|~set(X2)|~member(X1,X2))). % 0.19/0.39 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))). % 0.19/0.39 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.19/0.39 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). % 0.19/0.39 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))). % 0.19/0.39 cnf(i_0_32, plain, (subset(X1,X2)|~member(X2,on)|~member(X1,X2))). % 0.19/0.39 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))). % 0.19/0.39 cnf(i_0_76, plain, (member(X1,X2)|~member(X1,initial_segment(X3,X4,X2)))). % 0.19/0.39 cnf(i_0_45, plain, (apply(member_predicate,X1,X2)|~member(X1,X2))). % 0.19/0.39 cnf(i_0_75, plain, (apply(X1,X2,X3)|~member(X2,initial_segment(X3,X1,X4)))). % 0.19/0.39 cnf(i_0_23, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))). % 0.19/0.39 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.19/0.39 cnf(i_0_12, plain, (member(X1,union(X2,X3))|~member(X1,X3))). % 0.19/0.39 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 0.19/0.39 cnf(i_0_77, plain, (member(X1,suc(X2))|~member(X1,union(X2,singleton(X2))))). % 0.19/0.39 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))). % 0.19/0.39 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))). % 0.19/0.39 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))). % 0.19/0.39 cnf(i_0_28, plain, (member(esk3_2(X1,X2),X2)|member(X1,product(X2)))). % 0.19/0.39 cnf(i_0_35, plain, (strict_well_order(X1,X2)|~least(X3,X1,esk6_2(X1,X2))|~strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_41, plain, (least(X1,X2,X3)|esk8_3(X2,X3,X1)!=X1|~member(X1,X3))). % 0.19/0.39 cnf(i_0_30, plain, (member(X1,on)|~strict_well_order(member_predicate,X1)|~set(X1)|~subset(esk4_1(X1),X1))). % 0.19/0.39 cnf(i_0_14, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). % 0.19/0.39 cnf(i_0_78, plain, (member(X1,union(X2,singleton(X2)))|~member(X1,suc(X2)))). % 0.19/0.39 cnf(i_0_29, plain, (member(X1,X2)|~member(X1,product(X3))|~member(X2,X3))). % 0.19/0.39 cnf(i_0_24, plain, (member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2))). % 0.19/0.39 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.19/0.39 cnf(i_0_16, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). % 0.19/0.39 cnf(i_0_31, plain, (member(esk4_1(X1),X1)|member(X1,on)|~strict_well_order(member_predicate,X1)|~set(X1))). % 0.19/0.39 cnf(i_0_37, plain, (strict_well_order(X1,X2)|subset(esk6_2(X1,X2),X2)|~strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_40, plain, (least(X1,X2,X3)|~apply(X2,X1,esk8_3(X2,X3,X1))|~member(X1,X3))). % 0.19/0.39 cnf(i_0_74, plain, (member(X1,initial_segment(X2,X3,X4))|~apply(X3,X1,X2)|~member(X1,X4))). % 0.19/0.39 cnf(i_0_72, plain, (~apply(X1,X2,X3)|~apply(X1,X3,X2)|~strict_order(X1,X4)|~member(X2,X4)|~member(X3,X4))). % 0.19/0.39 cnf(i_0_43, plain, (X1=X2|apply(X3,X2,X1)|~least(X2,X3,X4)|~member(X1,X4))). % 0.19/0.39 cnf(i_0_70, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|member(esk9_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_42, plain, (least(X1,X2,X3)|member(esk8_3(X2,X3,X1),X3)|~member(X1,X3))). % 0.19/0.39 cnf(i_0_69, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|member(esk9_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_68, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|member(esk9_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_64, plain, (strict_order(X1,X2)|member(esk11_2(X1,X2),X2)|member(esk10_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_63, plain, (strict_order(X1,X2)|member(esk12_2(X1,X2),X2)|member(esk10_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_62, plain, (strict_order(X1,X2)|member(esk13_2(X1,X2),X2)|member(esk10_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_65, plain, (strict_order(X1,X2)|member(esk9_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))). % 0.19/0.39 cnf(i_0_59, plain, (strict_order(X1,X2)|member(esk10_2(X1,X2),X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))). % 0.19/0.39 cnf(i_0_36, plain, (strict_well_order(X1,X2)|member(esk7_2(X1,X2),esk6_2(X1,X2))|~strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_38, plain, (least(esk5_3(X1,X2,X3),X1,X3)|~strict_well_order(X1,X2)|~member(X4,X3)|~subset(X3,X2))). % 0.19/0.39 cnf(i_0_67, plain, (apply(X1,esk11_2(X1,X2),esk12_2(X1,X2))|strict_order(X1,X2)|member(esk9_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_53, plain, (apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))). % 0.19/0.39 cnf(i_0_47, plain, (apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2)|~apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)))). % 0.19/0.39 cnf(i_0_66, plain, (apply(X1,esk12_2(X1,X2),esk13_2(X1,X2))|strict_order(X1,X2)|member(esk9_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_61, plain, (apply(X1,esk11_2(X1,X2),esk12_2(X1,X2))|strict_order(X1,X2)|member(esk10_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_60, plain, (apply(X1,esk12_2(X1,X2),esk13_2(X1,X2))|strict_order(X1,X2)|member(esk10_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_58, plain, (apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2)|member(esk11_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_52, plain, (apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2)|member(esk11_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_57, plain, (apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2)|member(esk12_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_51, plain, (apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2)|member(esk12_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_56, plain, (apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2)|member(esk13_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_50, plain, (apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2)|member(esk13_2(X1,X2),X2))). % 0.19/0.39 cnf(i_0_55, plain, (apply(X1,esk11_2(X1,X2),esk12_2(X1,X2))|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_54, plain, (apply(X1,esk12_2(X1,X2),esk13_2(X1,X2))|apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))|strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_49, plain, (apply(X1,esk11_2(X1,X2),esk12_2(X1,X2))|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_48, plain, (apply(X1,esk12_2(X1,X2),esk13_2(X1,X2))|apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))|strict_order(X1,X2))). % 0.19/0.39 cnf(i_0_71, plain, (apply(X1,X2,X3)|~apply(X1,X4,X3)|~apply(X1,X2,X4)|~strict_order(X1,X5)|~member(X3,X5)|~member(X4,X5)|~member(X2,X5))). % 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.39 # Begin printing tableau % 0.19/0.39 # Found 10 steps % 0.19/0.39 cnf(i_0_79, negated_conjecture, (member(esk14_0,esk14_0)), inference(start_rule)). % 0.19/0.39 cnf(i_0_84, plain, (member(esk14_0,esk14_0)), inference(extension_rule, [i_0_72])). % 0.19/0.39 cnf(i_0_196, plain, (~member(esk14_0,esk14_0)), inference(closure_rule, [i_0_79])). % 0.19/0.39 cnf(i_0_193, plain, (~apply(member_predicate,esk14_0,esk14_0)), inference(extension_rule, [i_0_75])). % 0.19/0.39 cnf(i_0_337, plain, (~member(esk14_0,initial_segment(esk14_0,member_predicate,X5))), inference(extension_rule, [i_0_46])). % 0.19/0.39 cnf(i_0_195, plain, (~strict_order(member_predicate,esk14_0)), inference(extension_rule, [i_0_39])). % 0.19/0.39 cnf(i_0_887, plain, (~strict_well_order(member_predicate,esk14_0)), inference(extension_rule, [i_0_33])). % 0.19/0.39 cnf(i_0_899, plain, (~member(esk14_0,on)), inference(closure_rule, [i_0_80])). % 0.19/0.39 cnf(i_0_355, plain, (~apply(member_predicate,esk14_0,initial_segment(esk14_0,member_predicate,X5))), inference(etableau_closure_rule, [i_0_355, ...])). % 0.19/0.39 cnf(i_0_194, plain, (~apply(member_predicate,esk14_0,esk14_0)), inference(etableau_closure_rule, [i_0_194, ...])). % 0.19/0.39 # End printing tableau % 0.19/0.39 # SZS output end % 0.19/0.39 # Branches closed with saturation will be marked with an "s" % 0.19/0.39 # Child (9062) has found a proof. % 0.19/0.39 % 0.19/0.39 # Proof search is over... % 0.19/0.39 # Freeing feature tree %------------------------------------------------------------------------------