%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET976+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 : n008.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:13 EDT 2022 % Result : Theorem 0.15s 0.39s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SET976+1 : TPTP v8.1.0. Released v3.2.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.35 % Computer : n008.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Mon Jul 11 09:42:23 EDT 2022 % 0.15/0.35 % CPUTime : % 0.15/0.38 # No SInE strategy applied % 0.15/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.38 # % 0.15/0.38 # Presaturation interreduction done % 0.15/0.38 # Number of axioms: 15 Number of unprocessed: 15 % 0.15/0.38 # Tableaux proof search. % 0.15/0.38 # APR header successfully linked. % 0.15/0.38 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 15 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 3 conjectures. % 0.15/0.39 # There are 3 start rule candidates: % 0.15/0.39 # Found 5 unit axioms. % 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.39 # 3 start rule tableaux created. % 0.15/0.39 # 10 extension rule candidate clauses % 0.15/0.39 # 5 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.15/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.15/0.39 # We now have 10 tableaux to operate on % 0.15/0.39 # There were 2 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 2 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 2 successful branch saturations after the branch. % 0.15/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_12, plain, (empty(esk2_0))). % 0.15/0.39 cnf(i_0_5, plain, (in(X1,singleton(X1)))). % 0.15/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.15/0.39 cnf(i_0_13, plain, (~empty(esk3_0))). % 0.15/0.39 cnf(i_0_8, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.15/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.39 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.15/0.39 cnf(i_0_16, negated_conjecture, (esk5_0!=esk7_0|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|~in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_14, negated_conjecture, (esk5_0=esk7_0|in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))))). % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.15/0.39 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.15/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))). % 0.15/0.39 cnf(i_0_11, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))). % 0.15/0.39 cnf(i_0_9, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 6 steps % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0)), inference(start_rule)). % 0.15/0.39 cnf(i_0_21, plain, (in(esk4_0,esk6_0)), inference(extension_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_66, plain, (~in(X5,singleton(X5))), inference(closure_rule, [i_0_5])). % 0.15/0.39 cnf(i_0_65, plain, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X5)),cartesian_product2(esk6_0,singleton(X5)))), inference(extension_rule, [i_0_1])). % 0.15/0.39 cnf(i_0_20, plain, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))), inference(etableau_closure_rule, [i_0_20, ...])). % 0.15/0.39 cnf(i_0_76, plain, (~in(cartesian_product2(esk6_0,singleton(X5)),unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X5)))), inference(etableau_closure_rule, [i_0_76, ...])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # There were 2 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 2 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 2 successful branch saturations after the branch. % 0.15/0.39 # There were 2 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 2 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 2 successful branch saturations after the branch. % 0.15/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_12, plain, (empty(esk2_0))). % 0.15/0.39 cnf(i_0_5, plain, (in(X1,singleton(X1)))). % 0.15/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.15/0.39 cnf(i_0_13, plain, (~empty(esk3_0))). % 0.15/0.39 cnf(i_0_8, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.15/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.39 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.15/0.39 cnf(i_0_16, negated_conjecture, (esk5_0!=esk7_0|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|~in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_14, negated_conjecture, (esk5_0=esk7_0|in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))))). % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.15/0.39 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.15/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))). % 0.15/0.39 cnf(i_0_11, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))). % 0.15/0.39 cnf(i_0_9, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 5 steps % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0)), inference(start_rule)). % 0.15/0.39 cnf(i_0_21, plain, (in(esk4_0,esk6_0)), inference(extension_rule, [i_0_1])). % 0.15/0.39 cnf(i_0_51, plain, (~in(esk6_0,esk4_0)), inference(extension_rule, [i_0_10])). % 0.15/0.39 cnf(i_0_20, plain, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))), inference(etableau_closure_rule, [i_0_20, ...])). % 0.15/0.39 cnf(i_0_86, plain, (~in(unordered_pair(singleton(X7),unordered_pair(X7,esk6_0)),cartesian_product2(X8,esk4_0))), inference(etableau_closure_rule, [i_0_86, ...])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # There were 2 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 2 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 2 successful branch saturations after the branch. % 0.15/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_12, plain, (empty(esk2_0))). % 0.15/0.39 cnf(i_0_5, plain, (in(X1,singleton(X1)))). % 0.15/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.15/0.39 cnf(i_0_13, plain, (~empty(esk3_0))). % 0.15/0.39 cnf(i_0_8, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.15/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.39 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.15/0.39 cnf(i_0_16, negated_conjecture, (esk5_0!=esk7_0|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|~in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_14, negated_conjecture, (esk5_0=esk7_0|in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))))). % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.15/0.39 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.15/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))). % 0.15/0.39 cnf(i_0_11, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))). % 0.15/0.39 cnf(i_0_9, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 6 steps % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0)), inference(start_rule)). % 0.15/0.39 cnf(i_0_21, plain, (in(esk4_0,esk6_0)), inference(extension_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_67, plain, (~in(X6,singleton(X6))), inference(closure_rule, [i_0_5])). % 0.15/0.39 cnf(i_0_65, plain, (in(unordered_pair(singleton(X6),unordered_pair(X6,esk4_0)),cartesian_product2(singleton(X6),esk6_0))), inference(extension_rule, [i_0_1])). % 0.15/0.39 cnf(i_0_20, plain, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))), inference(etableau_closure_rule, [i_0_20, ...])). % 0.15/0.39 cnf(i_0_76, plain, (~in(cartesian_product2(singleton(X6),esk6_0),unordered_pair(singleton(X6),unordered_pair(X6,esk4_0)))), inference(etableau_closure_rule, [i_0_76, ...])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # There were 2 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 2 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 2 successful branch saturations after the branch. % 0.15/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_12, plain, (empty(esk2_0))). % 0.15/0.39 cnf(i_0_5, plain, (in(X1,singleton(X1)))). % 0.15/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.15/0.39 cnf(i_0_13, plain, (~empty(esk3_0))). % 0.15/0.39 cnf(i_0_8, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.15/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.39 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.15/0.39 cnf(i_0_16, negated_conjecture, (esk5_0!=esk7_0|~in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|~in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_14, negated_conjecture, (esk5_0=esk7_0|in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))))). % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0))). % 0.15/0.39 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.15/0.39 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.15/0.39 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))). % 0.15/0.39 cnf(i_0_11, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))). % 0.15/0.39 cnf(i_0_9, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 5 steps % 0.15/0.39 cnf(i_0_15, negated_conjecture, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))|in(esk4_0,esk6_0)), inference(start_rule)). % 0.15/0.39 cnf(i_0_20, plain, (in(unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))), inference(extension_rule, [i_0_1])). % 0.15/0.39 cnf(i_0_27, plain, (~in(cartesian_product2(esk6_0,singleton(esk7_0)),unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0)))), inference(extension_rule, [i_0_10])). % 0.15/0.39 cnf(i_0_21, plain, (in(esk4_0,esk6_0)), inference(etableau_closure_rule, [i_0_21, ...])). % 0.15/0.39 cnf(i_0_110, plain, (~in(unordered_pair(singleton(X7),unordered_pair(X7,cartesian_product2(esk6_0,singleton(esk7_0)))),cartesian_product2(X8,unordered_pair(singleton(esk4_0),unordered_pair(esk5_0,esk4_0))))), inference(etableau_closure_rule, [i_0_110, ...])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # Child (7703) has found a proof. % 0.15/0.39 % 0.15/0.39 # Proof search is over... % 0.15/0.39 # Freeing feature tree %------------------------------------------------------------------------------