0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.34 % Computer : n013.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 16:54:33 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.37 # No SInE strategy applied 0.19/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_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: 21 Number of unprocessed: 19 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.37 # The folding up rule is enabled... 0.19/0.37 # Local unification is enabled... 0.19/0.37 # Any saturation attempts will use folding labels... 0.19/0.37 # 19 beginning clauses after preprocessing and clausification 0.19/0.37 # Creating start rules for all 1 conjectures. 0.19/0.37 # There are 1 start rule candidates: 0.19/0.37 # Found 4 unit axioms. 0.19/0.37 # 1 start rule tableaux created. 0.19/0.37 # 15 extension rule candidate clauses 0.19/0.37 # 4 unit axiom clauses 0.19/0.37 0.19/0.37 # Requested 8, 32 cores available to the main process. 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 3.14/3.31 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. 3.14/3.31 # We now have 9 tableaux to operate on 13.18/4.60 # There were 15 total branch saturation attempts. 13.18/4.60 # There were 1 of these attempts blocked. 13.18/4.60 # There were 0 deferred branch saturation attempts. 13.18/4.60 # There were 6 free duplicated saturations. 13.18/4.60 # There were 9 total successful branch saturations. 13.18/4.60 # There were 0 successful branch saturations in interreduction. 13.18/4.60 # There were 0 successful branch saturations on the branch. 13.18/4.60 # There were 3 successful branch saturations after the branch. 13.18/4.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 13.18/4.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 13.18/4.60 # Begin clausification derivation 13.18/4.60 13.18/4.60 # End clausification derivation 13.18/4.60 # Begin listing active clauses obtained from FOF to CNF conversion 13.18/4.60 cnf(i_0_22, plain, (subset(X1,X1))). 13.18/4.60 cnf(i_0_1, plain, (union(X1,X2)=union(X2,X1))). 13.18/4.60 cnf(i_0_23, plain, (intersection(X1,X2)=intersection(X2,X1))). 13.18/4.60 cnf(i_0_21, negated_conjecture, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0)). 13.18/4.60 cnf(i_0_19, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1))). 13.18/4.60 cnf(i_0_16, plain, (member(X1,union(X2,X3))|~member(X1,X3))). 13.18/4.60 cnf(i_0_17, plain, (member(X1,union(X2,X3))|~member(X1,X2))). 13.18/4.60 cnf(i_0_7, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). 13.18/4.60 cnf(i_0_11, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). 13.18/4.60 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). 13.18/4.60 cnf(i_0_4, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). 13.18/4.60 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). 13.18/4.60 cnf(i_0_18, plain, (subset(X1,X2)|~member(esk2_2(X1,X2),X2))). 13.18/4.60 cnf(i_0_14, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). 13.18/4.60 cnf(i_0_20, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). 13.18/4.60 cnf(i_0_9, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). 13.18/4.60 cnf(i_0_15, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). 13.18/4.60 cnf(i_0_2, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). 13.18/4.60 cnf(i_0_8, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). 13.18/4.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 13.18/4.60 # Begin printing tableau 13.18/4.60 # Found 15 steps 13.18/4.60 cnf(i_0_21, negated_conjecture, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0), inference(start_rule)). 13.18/4.60 cnf(i_0_26, plain, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0), inference(extension_rule, [i_0_8])). 13.18/4.60 cnf(i_0_62, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),esk3_0)), inference(extension_rule, [i_0_9])). 13.18/4.60 cnf(i_0_63, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)))), inference(etableau_closure_rule, [i_0_63, ...])). 13.18/4.60 cnf(i_0_390663, plain, (member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0))), inference(extension_rule, [i_0_16])). 13.18/4.60 cnf(i_0_390665, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8))), inference(extension_rule, [i_0_17])). 13.18/4.60 cnf(i_0_541802, plain, (member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)))), inference(extension_rule, [i_0_11])). 13.18/4.60 cnf(i_0_703643, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),difference(X11,union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0))))), inference(extension_rule, [i_0_20])). 13.18/4.60 cnf(i_0_703654, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)))), inference(closure_rule, [i_0_541802])). 13.18/4.60 cnf(i_0_703653, plain, (~subset(union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)),difference(X11,union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0))))), inference(extension_rule, [i_0_19])). 13.18/4.60 cnf(i_0_703656, plain, (member(esk2_2(union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)),difference(X11,union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)))),union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)))), inference(extension_rule, [i_0_17])). 13.18/4.60 cnf(i_0_541807, plain, (~member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)))), inference(extension_rule, [i_0_7])). 13.18/4.60 cnf(i_0_703675, plain, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))=esk3_0), inference(closure_rule, [i_0_21])). 13.18/4.60 cnf(i_0_703677, plain, (member(esk1_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),esk3_0)), inference(closure_rule, [i_0_62])). 13.18/4.60 cnf(i_0_703665, plain, (member(esk2_2(union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)),difference(X11,union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)))),union(union(X12,difference(union(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),X8),esk3_0)),X10))), inference(etableau_closure_rule, [i_0_703665, ...])). 13.18/4.60 # End printing tableau 13.18/4.60 # SZS output end 13.18/4.60 # Branches closed with saturation will be marked with an "s" 13.18/4.62 # Child (27540) has found a proof. 13.18/4.62 13.18/4.62 # Proof search is over... 13.18/4.62 # Freeing feature tree 13.18/4.62 EOF