%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET968+1 : TPTP v8.1.0. Released v3.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 01:04:10 EDT 2022 % Result : Theorem 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET968+1 : TPTP v8.1.0. Released v3.2.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.14/0.34 % Computer : n004.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jul 11 02:43:52 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S % 0.14/0.37 # and selection function SelectNewComplexAHP. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 10 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 1 conjectures. % 0.14/0.37 # There are 1 start rule candidates: % 0.14/0.37 # Found 8 unit axioms. % 0.14/0.37 # 1 start rule tableaux created. % 0.14/0.37 # 2 extension rule candidate clauses % 0.14/0.37 # 8 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.37 # Creating equality axioms % 0.14/0.37 # Ran out of tableaux, making start rules for all clauses % 0.14/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 11 tableaux to operate on % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 1 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 0 successful branch saturations after the branch. % 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_5, plain, (empty(esk1_0))). % 0.14/0.38 cnf(i_0_6, plain, (~empty(esk2_0))). % 0.14/0.38 cnf(i_0_4, plain, (set_union2(X1,X1)=X1)). % 0.14/0.38 cnf(i_0_1, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.14/0.38 cnf(i_0_3, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.14/0.38 cnf(i_0_2, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.14/0.38 cnf(i_0_10, plain, (set_union2(set_union2(X1,X2),X3)=set_union2(X1,set_union2(X2,X3)))). % 0.14/0.38 cnf(i_0_7, plain, (cartesian_product2(X1,set_union2(X2,X3))=set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3)))). % 0.14/0.38 cnf(i_0_8, plain, (cartesian_product2(set_union2(X1,X2),X3)=set_union2(cartesian_product2(X1,X3),cartesian_product2(X2,X3)))). % 0.14/0.38 cnf(i_0_9, negated_conjecture, (cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0))!=set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0)))). % 0.14/0.38 cnf(i_0_16, plain, (X24=X24)). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 6 steps % 0.14/0.38 cnf(i_0_5, plain, (empty(esk1_0)), inference(start_rule)). % 0.14/0.38 cnf(i_0_23, plain, (empty(esk1_0)), inference(extension_rule, [i_0_21])). % 0.14/0.38 cnf(i_0_50, plain, (empty(esk2_0)), inference(closure_rule, [i_0_6])). % 0.14/0.38 cnf(i_0_51, plain, (esk1_0!=esk2_0), inference(extension_rule, [i_0_19])). % 0.14/0.38 cnf(i_0_65, plain, (esk1_0!=set_union2(esk1_0,esk1_0)), inference(closure_rule, [i_0_4])). % 0.14/0.38 cnf(i_0_66, plain, (set_union2(esk1_0,esk1_0)!=esk2_0), inference(etableau_closure_rule, [i_0_66, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 1 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 0 successful branch saturations after the branch. % 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_5, plain, (empty(esk1_0))). % 0.14/0.38 cnf(i_0_6, plain, (~empty(esk2_0))). % 0.14/0.38 cnf(i_0_4, plain, (set_union2(X1,X1)=X1)). % 0.14/0.38 cnf(i_0_1, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.14/0.38 cnf(i_0_3, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.14/0.38 cnf(i_0_2, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.14/0.38 cnf(i_0_10, plain, (set_union2(set_union2(X1,X2),X3)=set_union2(X1,set_union2(X2,X3)))). % 0.14/0.38 cnf(i_0_7, plain, (cartesian_product2(X1,set_union2(X2,X3))=set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3)))). % 0.14/0.38 cnf(i_0_8, plain, (cartesian_product2(set_union2(X1,X2),X3)=set_union2(cartesian_product2(X1,X3),cartesian_product2(X2,X3)))). % 0.14/0.38 cnf(i_0_9, negated_conjecture, (cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0))!=set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0)))). % 0.14/0.38 cnf(i_0_16, plain, (X24=X24)). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 4 steps % 0.14/0.38 cnf(i_0_6, plain, (~empty(esk2_0)), inference(start_rule)). % 0.14/0.38 cnf(i_0_24, plain, (~empty(esk2_0)), inference(extension_rule, [i_0_3])). % 0.14/0.38 cnf(i_0_57, plain, (~empty(set_union2(X6,esk2_0))), inference(extension_rule, [i_0_2])). % 0.14/0.38 cnf(i_0_59, plain, (~empty(set_union2(set_union2(X6,esk2_0),X5))), inference(etableau_closure_rule, [i_0_59, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 1 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 0 successful branch saturations after the branch. % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 1 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 0 successful branch saturations after the branch. % 0.14/0.38 # Child (27254) has found a proof. % 0.14/0.38 % 0.14/0.38 # Proof search is over... % 0.14/0.38 # Freeing feature tree %------------------------------------------------------------------------------