%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET171+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 : n003.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 00:58:33 EDT 2022 % Result : Theorem 37.16s 5.77s % Output : CNFRefutation 37.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET171+3 : TPTP v8.1.0. Released v2.2.0. % 0.00/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 : n003.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 22:18:44 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y % 0.18/0.36 # and selection function SelectMaxLComplexAPPNTNp. % 0.18/0.36 # % 0.18/0.36 # Number of axioms: 18 Number of unprocessed: 18 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.91/1.10 # The folding up rule is enabled... % 0.91/1.10 # Local unification is enabled... % 0.91/1.10 # Any saturation attempts will use folding labels... % 0.91/1.10 # 18 beginning clauses after preprocessing and clausification % 0.91/1.10 # Creating start rules for all 1 conjectures. % 0.91/1.10 # There are 1 start rule candidates: % 0.91/1.10 # Found 4 unit axioms. % 0.91/1.10 # 1 start rule tableaux created. % 0.91/1.10 # 14 extension rule candidate clauses % 0.91/1.10 # 4 unit axiom clauses % 0.91/1.10 % 0.91/1.10 # Requested 8, 32 cores available to the main process. % 0.91/1.10 # There are not enough tableaux to fork, creating more from the initial 1 % 0.91/1.14 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.91/1.14 # We now have 8 tableaux to operate on % 37.16/5.77 # There were 24 total branch saturation attempts. % 37.16/5.77 # There were 13 of these attempts blocked. % 37.16/5.77 # There were 0 deferred branch saturation attempts. % 37.16/5.77 # There were 1 free duplicated saturations. % 37.16/5.77 # There were 8 total successful branch saturations. % 37.16/5.77 # There were 0 successful branch saturations in interreduction. % 37.16/5.77 # There were 0 successful branch saturations on the branch. % 37.16/5.77 # There were 7 successful branch saturations after the branch. % 37.16/5.77 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 37.16/5.77 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 37.16/5.77 # Begin clausification derivation % 37.16/5.77 % 37.16/5.77 # End clausification derivation % 37.16/5.77 # Begin listing active clauses obtained from FOF to CNF conversion % 37.16/5.77 cnf(i_0_15, plain, (subset(X1,X1))). % 37.16/5.77 cnf(i_0_8, plain, (subset(X1,X2)|X1!=X2)). % 37.16/5.77 cnf(i_0_9, plain, (subset(X1,X2)|X1!=X2)). % 37.16/5.77 cnf(i_0_10, plain, (union(X1,X2)=union(X2,X1))). % 37.16/5.77 cnf(i_0_11, plain, (intersection(X1,X2)=intersection(X2,X1))). % 37.16/5.77 cnf(i_0_7, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 37.16/5.77 cnf(i_0_13, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))). % 37.16/5.77 cnf(i_0_14, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))). % 37.16/5.77 cnf(i_0_1, plain, (member(X1,union(X3,X2))|~member(X1,X2))). % 37.16/5.77 cnf(i_0_2, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 37.16/5.77 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 37.16/5.77 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 37.16/5.77 cnf(i_0_12, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 37.16/5.77 cnf(i_0_16, plain, (X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1))). % 37.16/5.77 cnf(i_0_4, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 37.16/5.77 cnf(i_0_3, plain, (member(X1,X3)|member(X1,X2)|~member(X1,union(X2,X3)))). % 37.16/5.77 cnf(i_0_17, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 37.16/5.77 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk4_0,esk5_0))!=intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))). % 37.16/5.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 37.16/5.77 # Begin printing tableau % 37.16/5.77 # Found 22 steps % 37.16/5.77 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk4_0,esk5_0))!=intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))), inference(start_rule)). % 37.16/5.77 cnf(i_0_21, plain, (union(esk3_0,intersection(esk4_0,esk5_0))!=intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))), inference(extension_rule, [i_0_17])). % 37.16/5.77 cnf(i_0_54, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))), inference(extension_rule, [i_0_4])). % 37.16/5.77 cnf(i_0_164084, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(esk3_0,esk5_0))), inference(extension_rule, [i_0_14])). % 37.16/5.77 cnf(i_0_164085, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(esk3_0,esk4_0))), inference(extension_rule, [i_0_1])). % 37.16/5.77 cnf(i_0_55, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_2])). % 37.16/5.77 cnf(i_0_164114, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),esk4_0)), inference(etableau_closure_rule, [i_0_164114, ...])). % 37.16/5.77 cnf(i_0_164125, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),esk3_0)), inference(extension_rule, [i_0_5])). % 37.16/5.77 cnf(i_0_425937, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),intersection(union(esk3_0,intersection(esk4_0,esk5_0)),esk3_0))), inference(etableau_closure_rule, [i_0_425937, ...])). % 37.16/5.77 cnf(i_0_164102, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))))), inference(extension_rule, [i_0_1])). % 37.16/5.77 cnf(i_0_433571, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))))), inference(extension_rule, [i_0_4])). % 37.16/5.77 cnf(i_0_433579, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))), inference(extension_rule, [i_0_16])). % 37.16/5.77 cnf(i_0_433587, plain, (intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))=union(esk3_0,intersection(esk4_0,esk5_0))), inference(closure_rule, [i_0_20])). % 37.16/5.77 cnf(i_0_433589, plain, (member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_2])). % 37.16/5.77 cnf(i_0_433604, plain, (member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))))), inference(closure_rule, [i_0_164102])). % 37.16/5.77 cnf(i_0_433580, plain, (~member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))), inference(closure_rule, [i_0_433579])). % 37.16/5.77 cnf(i_0_164103, plain, (~subset(union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))),union(esk3_0,esk5_0))), inference(extension_rule, [i_0_8])). % 37.16/5.77 cnf(i_0_433613, plain, (union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0))))!=union(esk3_0,esk5_0)), inference(extension_rule, [i_0_17])). % 37.16/5.77 cnf(i_0_433618, plain, (~member(esk2_2(union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))),union(esk3_0,esk5_0)),union(esk3_0,esk5_0))), inference(extension_rule, [i_0_5])). % 37.16/5.77 cnf(i_0_433619, plain, (~member(esk2_2(union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))),union(esk3_0,esk5_0)),union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))))), inference(etableau_closure_rule, [i_0_433619, ...])). % 37.16/5.77 cnf(i_0_433630, plain, (~member(esk2_2(union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))),union(esk3_0,esk5_0)),intersection(X8,union(esk3_0,esk5_0)))), inference(extension_rule, [i_0_6])). % 37.16/5.77 cnf(i_0_903901, plain, (~member(esk2_2(union(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)),intersection(union(esk3_0,esk4_0),union(esk3_0,esk5_0)))),union(esk3_0,esk5_0)),intersection(intersection(X8,union(esk3_0,esk5_0)),X7))), inference(etableau_closure_rule, [i_0_903901, ...])). % 37.16/5.77 # End printing tableau % 37.16/5.77 # SZS output end % 37.16/5.77 # Branches closed with saturation will be marked with an "s" % 37.80/5.79 # Child (12125) has found a proof. % 37.80/5.79 % 37.80/5.79 # Proof search is over... % 37.80/5.79 # Freeing feature tree %------------------------------------------------------------------------------