%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET143+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 : n004.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:17 EDT 2022 % Result : Theorem 10.87s 3.32s % Output : CNFRefutation 10.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET143+3 : TPTP v8.1.0. Released v2.2.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n004.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 02:11:07 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y % 0.19/0.37 # and selection function SelectMaxLComplexAPPNTNp. % 0.19/0.37 # % 0.19/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 1.07/1.29 # The folding up rule is enabled... % 1.07/1.29 # Local unification is enabled... % 1.07/1.29 # Any saturation attempts will use folding labels... % 1.07/1.29 # 14 beginning clauses after preprocessing and clausification % 1.07/1.29 # Creating start rules for all 1 conjectures. % 1.07/1.29 # There are 1 start rule candidates: % 1.07/1.29 # Found 3 unit axioms. % 1.07/1.29 # 1 start rule tableaux created. % 1.07/1.29 # 11 extension rule candidate clauses % 1.07/1.29 # 3 unit axiom clauses % 1.07/1.29 % 1.07/1.29 # Requested 8, 32 cores available to the main process. % 1.07/1.29 # There are not enough tableaux to fork, creating more from the initial 1 % 1.97/2.14 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 1.97/2.14 # We now have 10 tableaux to operate on % 10.87/3.32 # There were 11 total branch saturation attempts. % 10.87/3.32 # There were 6 of these attempts blocked. % 10.87/3.32 # There were 0 deferred branch saturation attempts. % 10.87/3.32 # There were 0 free duplicated saturations. % 10.87/3.32 # There were 2 total successful branch saturations. % 10.87/3.32 # There were 0 successful branch saturations in interreduction. % 10.87/3.32 # There were 0 successful branch saturations on the branch. % 10.87/3.32 # There were 2 successful branch saturations after the branch. % 10.87/3.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.87/3.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.87/3.32 # Begin clausification derivation % 10.87/3.32 % 10.87/3.32 # End clausification derivation % 10.87/3.32 # Begin listing active clauses obtained from FOF to CNF conversion % 10.87/3.32 cnf(i_0_11, plain, (subset(X1,X1))). % 10.87/3.32 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)). % 10.87/3.32 cnf(i_0_6, plain, (subset(X1,X2)|X1!=X2)). % 10.87/3.32 cnf(i_0_7, plain, (intersection(X1,X2)=intersection(X2,X1))). % 10.87/3.32 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 10.87/3.32 cnf(i_0_9, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))). % 10.87/3.32 cnf(i_0_10, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))). % 10.87/3.32 cnf(i_0_2, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 10.87/3.32 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 10.87/3.32 cnf(i_0_8, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 10.87/3.32 cnf(i_0_12, plain, (X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1))). % 10.87/3.32 cnf(i_0_1, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 10.87/3.32 cnf(i_0_16, negated_conjecture, (intersection(intersection(esk3_0,esk4_0),esk5_0)!=intersection(esk3_0,intersection(esk4_0,esk5_0)))). % 10.87/3.32 cnf(i_0_13, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 10.87/3.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.87/3.32 # Begin printing tableau % 10.87/3.32 # Found 23 steps % 10.87/3.32 cnf(i_0_16, negated_conjecture, (intersection(intersection(esk3_0,esk4_0),esk5_0)!=intersection(esk3_0,intersection(esk4_0,esk5_0))), inference(start_rule)). % 10.87/3.32 cnf(i_0_17, plain, (intersection(intersection(esk3_0,esk4_0),esk5_0)!=intersection(esk3_0,intersection(esk4_0,esk5_0))), inference(extension_rule, [i_0_13])). % 10.87/3.32 cnf(i_0_43, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_10])). % 10.87/3.32 cnf(i_0_55, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_2])). % 10.87/3.32 cnf(i_0_56, plain, (~subset(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(closure_rule, [i_0_11])). % 10.87/3.32 cnf(i_0_44, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(esk3_0,esk4_0),esk5_0))), inference(extension_rule, [i_0_10])). % 10.87/3.32 cnf(i_0_324589, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(esk5_0,intersection(esk3_0,esk4_0)))), inference(extension_rule, [i_0_3])). % 10.87/3.32 cnf(i_0_324590, plain, (~subset(intersection(esk5_0,intersection(esk3_0,esk4_0)),intersection(intersection(esk3_0,esk4_0),esk5_0))), inference(extension_rule, [i_0_5])). % 10.87/3.32 cnf(i_0_482783, plain, (intersection(esk5_0,intersection(esk3_0,esk4_0))!=intersection(intersection(esk3_0,esk4_0),esk5_0)), inference(closure_rule, [i_0_7])). % 10.87/3.32 cnf(i_0_324578, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0))))), inference(extension_rule, [i_0_10])). % 10.87/3.32 cnf(i_0_483518, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_12])). % 10.87/3.32 cnf(i_0_483523, plain, (intersection(intersection(esk3_0,esk4_0),esk5_0)=intersection(esk3_0,intersection(esk4_0,esk5_0))), inference(closure_rule, [i_0_16])). % 10.87/3.32 cnf(i_0_483525, plain, (member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(esk3_0,esk4_0),esk5_0))), inference(extension_rule, [i_0_1])). % 10.87/3.32 cnf(i_0_483534, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(esk3_0,esk4_0),esk5_0))), inference(closure_rule, [i_0_483525])). % 10.87/3.32 cnf(i_0_482781, plain, (~member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(esk5_0,intersection(esk3_0,esk4_0)),X8))), inference(etableau_closure_rule, [i_0_482781, ...])). % 10.87/3.32 cnf(i_0_483532, plain, (member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(intersection(esk3_0,esk4_0),esk5_0)))), inference(extension_rule, [i_0_10])). % 10.87/3.32 cnf(i_0_483809, plain, (member(esk2_2(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(esk3_0,intersection(esk4_0,esk5_0))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(closure_rule, [i_0_483518])). % 10.87/3.32 cnf(i_0_483519, plain, (~subset(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0))))), inference(extension_rule, [i_0_9])). % 10.87/3.32 cnf(i_0_484503, plain, (member(esk1_2(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0)))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_1])). % 10.87/3.32 cnf(i_0_484774, plain, (~member(esk1_2(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0)))),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(closure_rule, [i_0_484503])). % 10.87/3.32 cnf(i_0_484772, plain, (member(esk1_2(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0)))),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0))))), inference(extension_rule, [i_0_8])). % 10.87/3.32 cnf(i_0_484802, plain, (subset(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(intersection(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0))))), inference(closure_rule, [i_0_483519])). % 10.87/3.32 cnf(i_0_483811, plain, (~subset(intersection(intersection(intersection(esk3_0,esk4_0),esk5_0),intersection(intersection(esk3_0,esk4_0),esk5_0)),intersection(esk3_0,intersection(esk4_0,esk5_0)))), inference(etableau_closure_rule, [i_0_483811, ...])). % 10.87/3.32 # End printing tableau % 10.87/3.32 # SZS output end % 10.87/3.32 # Branches closed with saturation will be marked with an "s" % 10.87/3.34 # Child (24789) has found a proof. % 10.87/3.34 % 10.87/3.34 # Proof search is over... % 10.87/3.34 # Freeing feature tree %------------------------------------------------------------------------------