0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.31 Computer : n003.cluster.edu 0.10/0.31 Model : x86_64 x86_64 0.10/0.31 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 RAMPerCPU : 8042.1875MB 0.10/0.31 OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Aug 9 05:51:06 EDT 2022 0.10/0.31 % CPUTime : 0.15/0.34 # No SInE strategy applied 0.15/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.15/0.34 # and selection function SelectComplexExceptUniqMaxHorn. 0.15/0.34 # 0.15/0.34 # Presaturation interreduction done 0.15/0.34 # Number of axioms: 32 Number of unprocessed: 32 0.15/0.34 # Tableaux proof search. 0.15/0.34 # APR header successfully linked. 0.15/0.34 # Hello from C++ 0.15/0.34 # The folding up rule is enabled... 0.15/0.34 # Local unification is enabled... 0.15/0.34 # Any saturation attempts will use folding labels... 0.15/0.34 # 32 beginning clauses after preprocessing and clausification 0.15/0.34 # Creating start rules for all 3 conjectures. 0.15/0.34 # There are 3 start rule candidates: 0.15/0.34 # Found 7 unit axioms. 0.15/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.15/0.34 # 3 start rule tableaux created. 0.15/0.34 # 25 extension rule candidate clauses 0.15/0.34 # 7 unit axiom clauses 0.15/0.34 0.15/0.34 # Requested 8, 32 cores available to the main process. 0.15/0.34 # There are not enough tableaux to fork, creating more from the initial 3 0.15/0.34 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. 0.15/0.34 # We now have 9 tableaux to operate on 18.48/2.72 # There were 3 total branch saturation attempts. 18.48/2.72 # There were 0 of these attempts blocked. 18.48/2.72 # There were 0 deferred branch saturation attempts. 18.48/2.72 # There were 0 free duplicated saturations. 18.48/2.72 # There were 2 total successful branch saturations. 18.48/2.72 # There were 0 successful branch saturations in interreduction. 18.48/2.72 # There were 0 successful branch saturations on the branch. 18.48/2.72 # There were 2 successful branch saturations after the branch. 18.48/2.72 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 18.48/2.72 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 18.48/2.72 # Begin clausification derivation 18.48/2.72 18.48/2.72 # End clausification derivation 18.48/2.72 # Begin listing active clauses obtained from FOF to CNF conversion 18.48/2.72 cnf(i_0_32, negated_conjecture, (subset(esk4_0,esk6_0))). 18.48/2.72 cnf(i_0_31, negated_conjecture, (subset(esk5_0,esk6_0))). 18.48/2.72 cnf(i_0_4, plain, (member(X1,singleton(X1)))). 18.48/2.72 cnf(i_0_9, plain, (member(X1,unordered_pair(X2,X1)))). 18.48/2.72 cnf(i_0_10, plain, (member(X1,unordered_pair(X1,X2)))). 18.48/2.72 cnf(i_0_30, negated_conjecture, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0))))). 18.48/2.72 cnf(i_0_12, plain, (~member(X1,empty_set))). 18.48/2.72 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X2,X1))). 18.48/2.72 cnf(i_0_7, plain, (subset(X1,X2)|~equal_set(X1,X2))). 18.48/2.72 cnf(i_0_28, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). 18.48/2.72 cnf(i_0_5, plain, (X1=X2|~member(X1,singleton(X2)))). 18.48/2.72 cnf(i_0_17, plain, (member(X1,power_set(X2))|~subset(X1,X2))). 18.48/2.72 cnf(i_0_16, plain, (subset(X1,X2)|~member(X1,power_set(X2)))). 18.48/2.72 cnf(i_0_8, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))). 18.48/2.72 cnf(i_0_18, plain, (subset(X1,X2)|~member(esk3_2(X1,X2),X2))). 18.48/2.72 cnf(i_0_22, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). 18.48/2.72 cnf(i_0_21, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). 18.48/2.72 cnf(i_0_20, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). 18.48/2.72 cnf(i_0_27, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). 18.48/2.72 cnf(i_0_2, plain, (member(X1,product(X2))|~member(X1,esk1_2(X1,X2)))). 18.48/2.72 cnf(i_0_11, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))). 18.48/2.72 cnf(i_0_19, plain, (subset(X1,X2)|member(esk3_2(X1,X2),X1))). 18.48/2.72 cnf(i_0_25, plain, (member(X1,union(X2,X3))|~member(X1,X3))). 18.48/2.72 cnf(i_0_24, plain, (member(X1,union(X2,X3))|~member(X1,X2))). 18.48/2.72 cnf(i_0_3, plain, (member(esk1_2(X1,X2),X2)|member(X1,product(X2)))). 18.48/2.72 cnf(i_0_13, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))). 18.48/2.72 cnf(i_0_14, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))). 18.48/2.72 cnf(i_0_26, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). 18.48/2.72 cnf(i_0_1, plain, (member(X1,X2)|~member(X1,product(X3))|~member(X2,X3))). 18.48/2.72 cnf(i_0_23, plain, (member(X1,intersection(X2,X3))|~member(X1,X2)|~member(X1,X3))). 18.48/2.72 cnf(i_0_29, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). 18.48/2.72 cnf(i_0_15, plain, (member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2))). 18.48/2.72 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 18.48/2.72 # Begin printing tableau 18.48/2.72 # Found 5 steps 18.48/2.72 cnf(i_0_30, negated_conjecture, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(start_rule)). 18.48/2.72 cnf(i_0_36, plain, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(extension_rule, [i_0_8])). 18.48/2.72 cnf(i_0_52, plain, (~subset(intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)),difference(esk6_0,union(esk4_0,esk5_0)))), inference(extension_rule, [i_0_7])). 18.48/2.72 cnf(i_0_53, plain, (~subset(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(etableau_closure_rule, [i_0_53, ...])). 18.48/2.72 cnf(i_0_139593, plain, (~equal_set(intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)),difference(esk6_0,union(esk4_0,esk5_0)))), inference(etableau_closure_rule, [i_0_139593, ...])). 18.48/2.72 # End printing tableau 18.48/2.72 # SZS output end 18.48/2.72 # Branches closed with saturation will be marked with an "s" 18.48/2.73 # Child (31999) has found a proof. 18.48/2.73 18.48/2.73 # Proof search is over... 18.48/2.73 # Freeing feature tree 18.48/2.76 EOF