%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET960+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 : n010.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:07 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET960+1 : TPTP v8.1.0. Released v3.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 : n010.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 : Sun Jul 10 07:06:45 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 19 Number of unprocessed: 19 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 19 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 3 conjectures. % 0.20/0.37 # There are 3 start rule candidates: % 0.20/0.37 # Found 6 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 3 start rule tableaux created. % 0.20/0.37 # 13 extension rule candidate clauses % 0.20/0.37 # 6 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 11 tableaux to operate on % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_14, plain, (empty(empty_set))). % 0.20/0.38 cnf(i_0_16, plain, (empty(esk7_0))). % 0.20/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.20/0.38 cnf(i_0_17, plain, (~empty(esk8_0))). % 0.20/0.38 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.20/0.38 cnf(i_0_15, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 0.20/0.38 cnf(i_0_20, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)!=empty_set|esk9_0!=empty_set)). % 0.20/0.38 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)!=empty_set|esk10_0!=empty_set)). % 0.20/0.38 cnf(i_0_18, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)=empty_set|esk10_0=empty_set|esk9_0=empty_set)). % 0.20/0.38 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.38 cnf(i_0_12, plain, (in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_11, plain, (in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_9, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.20/0.38 cnf(i_0_8, plain, (X1=cartesian_product2(X2,X3)|esk4_3(X2,X3,X1)!=unordered_pair(unordered_pair(X4,X5),singleton(X4))|~in(esk4_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))). % 0.20/0.38 cnf(i_0_7, plain, (X1=cartesian_product2(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_6, plain, (X1=cartesian_product2(X2,X3)|in(esk6_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_5, plain, (unordered_pair(singleton(esk5_3(X1,X2,X3)),unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)))=esk4_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk4_3(X1,X2,X3),X3))). % 0.20/0.38 cnf(i_0_10, plain, (unordered_pair(singleton(esk2_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk3_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_272, plain, (X40=X40)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_272, plain, (esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)=esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)), inference(start_rule)). % 0.20/0.38 cnf(i_0_321, plain, (esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)=esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)), inference(extension_rule, [i_0_276])). % 0.20/0.38 cnf(i_0_363, plain, (in(esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6),empty_set)), inference(closure_rule, [i_0_4])). % 0.20/0.38 cnf(i_0_365, plain, ($false), inference(closure_rule, [i_0_272])). % 0.20/0.38 cnf(i_0_366, plain, (~in(esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6),empty_set)), inference(extension_rule, [i_0_12])). % 0.20/0.38 cnf(i_0_372, plain, (~in(X6,cartesian_product2(empty_set,X5))), inference(etableau_closure_rule, [i_0_372, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_14, plain, (empty(empty_set))). % 0.20/0.38 cnf(i_0_16, plain, (empty(esk7_0))). % 0.20/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.20/0.38 cnf(i_0_17, plain, (~empty(esk8_0))). % 0.20/0.38 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.20/0.38 cnf(i_0_15, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 0.20/0.38 cnf(i_0_20, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)!=empty_set|esk9_0!=empty_set)). % 0.20/0.38 cnf(i_0_19, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)!=empty_set|esk10_0!=empty_set)). % 0.20/0.38 cnf(i_0_18, negated_conjecture, (cartesian_product2(esk9_0,esk10_0)=empty_set|esk10_0=empty_set|esk9_0=empty_set)). % 0.20/0.38 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.38 cnf(i_0_12, plain, (in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_11, plain, (in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_9, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.20/0.38 cnf(i_0_8, plain, (X1=cartesian_product2(X2,X3)|esk4_3(X2,X3,X1)!=unordered_pair(unordered_pair(X4,X5),singleton(X4))|~in(esk4_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))). % 0.20/0.38 cnf(i_0_7, plain, (X1=cartesian_product2(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_6, plain, (X1=cartesian_product2(X2,X3)|in(esk6_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_5, plain, (unordered_pair(singleton(esk5_3(X1,X2,X3)),unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)))=esk4_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk4_3(X1,X2,X3),X3))). % 0.20/0.38 cnf(i_0_10, plain, (unordered_pair(singleton(esk2_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk3_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.38 cnf(i_0_272, plain, (X40=X40)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_272, plain, (esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)=esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)), inference(start_rule)). % 0.20/0.38 cnf(i_0_321, plain, (esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)=esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6)), inference(extension_rule, [i_0_276])). % 0.20/0.38 cnf(i_0_363, plain, (in(esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6),empty_set)), inference(closure_rule, [i_0_4])). % 0.20/0.38 cnf(i_0_365, plain, ($false), inference(closure_rule, [i_0_272])). % 0.20/0.38 cnf(i_0_366, plain, (~in(esk2_4(empty_set,X5,cartesian_product2(empty_set,X5),X6),empty_set)), inference(extension_rule, [i_0_12])). % 0.20/0.38 cnf(i_0_372, plain, (~in(X6,cartesian_product2(empty_set,X5))), inference(etableau_closure_rule, [i_0_372, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (16474) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------