0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.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 : n014.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 03:11:46 EDT 2022 0.12/0.33 % CPUTime : 0.12/0.36 # No SInE strategy applied 0.12/0.36 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. 0.12/0.36 # 0.12/0.36 # Presaturation interreduction done 0.12/0.36 # Number of axioms: 23 Number of unprocessed: 21 0.12/0.36 # Tableaux proof search. 0.12/0.36 # APR header successfully linked. 0.12/0.36 # Hello from C++ 0.12/0.39 # The folding up rule is enabled... 0.12/0.39 # Local unification is enabled... 0.12/0.39 # Any saturation attempts will use folding labels... 0.12/0.39 # 21 beginning clauses after preprocessing and clausification 0.12/0.39 # Creating start rules for all 1 conjectures. 0.12/0.39 # There are 1 start rule candidates: 0.12/0.39 # Found 9 unit axioms. 0.12/0.39 # 1 start rule tableaux created. 0.12/0.39 # 12 extension rule candidate clauses 0.12/0.39 # 9 unit axiom clauses 0.12/0.39 0.12/0.39 # Requested 8, 32 cores available to the main process. 0.12/0.39 # There are not enough tableaux to fork, creating more from the initial 1 0.18/0.51 # There were 2 total branch saturation attempts. 0.18/0.51 # There were 0 of these attempts blocked. 0.18/0.51 # There were 0 deferred branch saturation attempts. 0.18/0.51 # There were 0 free duplicated saturations. 0.18/0.51 # There were 2 total successful branch saturations. 0.18/0.51 # There were 0 successful branch saturations in interreduction. 0.18/0.51 # There were 0 successful branch saturations on the branch. 0.18/0.51 # There were 2 successful branch saturations after the branch. 0.18/0.51 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.51 # Begin clausification derivation 0.18/0.51 0.18/0.51 # End clausification derivation 0.18/0.51 # Begin listing active clauses obtained from FOF to CNF conversion 0.18/0.51 cnf(i_0_16, plain, (intersection(X1,X1)=X1)). 0.18/0.51 cnf(i_0_15, plain, (subset(X1,X1))). 0.18/0.51 cnf(i_0_18, plain, (union(X1,intersection(X1,X2))=X1)). 0.18/0.51 cnf(i_0_9, plain, (intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3)))). 0.18/0.51 cnf(i_0_11, plain, (union(union(X1,X2),X3)=union(X1,union(X2,X3)))). 0.18/0.51 cnf(i_0_5, plain, (intersection(union(X1,X2),union(X1,X3))=union(X1,intersection(X2,X3)))). 0.18/0.51 cnf(i_0_1, plain, (union(X1,X2)=union(X2,X1))). 0.18/0.51 cnf(i_0_10, plain, (intersection(X1,X2)=intersection(X2,X1))). 0.18/0.51 cnf(i_0_17, negated_conjecture, (union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0)))!=intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0))))). 0.18/0.51 cnf(i_0_14, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))). 0.18/0.51 cnf(i_0_24, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). 0.18/0.51 cnf(i_0_25, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). 0.18/0.51 cnf(i_0_13, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). 0.18/0.51 cnf(i_0_2, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). 0.18/0.51 cnf(i_0_7, plain, (member(X1,union(X2,X3))|~member(X1,X3))). 0.18/0.51 cnf(i_0_6, plain, (member(X1,union(X2,X3))|~member(X1,X2))). 0.18/0.51 cnf(i_0_19, plain, (X1=X2|member(esk5_2(X1,X2),X1)|member(esk5_2(X1,X2),X2))). 0.18/0.51 cnf(i_0_12, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). 0.18/0.51 cnf(i_0_8, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). 0.18/0.51 cnf(i_0_23, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). 0.18/0.51 cnf(i_0_20, plain, (X1=X2|~member(esk5_2(X1,X2),X2)|~member(esk5_2(X1,X2),X1))). 0.18/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.18/0.51 # Begin printing tableau 0.18/0.51 # Found 5 steps 0.18/0.51 cnf(i_0_17, negated_conjecture, (union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0)))!=intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))), inference(start_rule)). 0.18/0.51 cnf(i_0_28, plain, (union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0)))!=intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))), inference(extension_rule, [i_0_20])). 0.18/0.51 cnf(i_0_57, plain, (~member(esk5_2(union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0))),intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))),intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0))))), inference(extension_rule, [i_0_24])). 0.18/0.51 cnf(i_0_58, plain, (~member(esk5_2(union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0))),intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))),union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0))))), inference(etableau_closure_rule, [i_0_58, ...])). 0.18/0.51 cnf(i_0_62, plain, (~member(esk5_2(union(intersection(esk2_0,esk4_0),union(intersection(esk2_0,esk3_0),intersection(esk3_0,esk4_0))),intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))),intersection(X6,intersection(union(esk2_0,esk4_0),intersection(union(esk2_0,esk3_0),union(esk3_0,esk4_0)))))), inference(etableau_closure_rule, [i_0_62, ...])). 0.18/0.51 # End printing tableau 0.18/0.51 # SZS output end 0.18/0.51 # Branches closed with saturation will be marked with an "s" 0.18/0.51 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. 0.18/0.51 # We now have 3 tableaux to operate on 0.18/0.51 # Found closed tableau during pool population. 0.18/0.51 # Proof search is over... 0.18/0.51 # Freeing feature tree 0.18/0.51 EOF