%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.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 : n006.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 09:23:55 EDT 2022 % Result : Theorem 0.21s 0.40s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0. % 0.14/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n006.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sun Jun 19 13:25:40 EDT 2022 % 0.21/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 23 Number of unprocessed: 23 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 23 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 3 conjectures. % 0.21/0.39 # There are 3 start rule candidates: % 0.21/0.39 # Found 6 unit axioms. % 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.39 # 3 start rule tableaux created. % 0.21/0.39 # 17 extension rule candidate clauses % 0.21/0.39 # 6 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.21/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.21/0.39 # We now have 11 tableaux to operate on % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_15, plain, (empty(empty_set))). % 0.21/0.40 cnf(i_0_17, plain, (empty(esk3_0))). % 0.21/0.40 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.21/0.40 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.21/0.40 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.21/0.40 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0))). % 0.21/0.40 cnf(i_0_23, negated_conjecture, (disjoint(esk6_0,esk7_0)|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.40 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.21/0.40 cnf(i_0_11, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.21/0.40 cnf(i_0_20, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.21/0.40 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.21/0.40 cnf(i_0_12, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.21/0.40 cnf(i_0_21, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X2))). % 0.21/0.40 cnf(i_0_22, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X1))). % 0.21/0.40 cnf(i_0_9, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.21/0.40 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.21/0.40 cnf(i_0_8, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.21/0.40 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 5 steps % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0)), inference(start_rule)). % 0.21/0.40 cnf(i_0_35, plain, (in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_1])). % 0.21/0.40 cnf(i_0_78, plain, (~in(set_intersection2(esk6_0,esk7_0),esk8_0)), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_36, plain, (~disjoint(esk6_0,esk7_0)), inference(etableau_closure_rule, [i_0_36, ...])). % 0.21/0.40 cnf(i_0_95, plain, (~in(set_intersection2(esk6_0,esk7_0),set_intersection2(X6,esk8_0))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_15, plain, (empty(empty_set))). % 0.21/0.40 cnf(i_0_17, plain, (empty(esk3_0))). % 0.21/0.40 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.21/0.40 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.21/0.40 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.21/0.40 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0))). % 0.21/0.40 cnf(i_0_23, negated_conjecture, (disjoint(esk6_0,esk7_0)|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.40 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.21/0.40 cnf(i_0_11, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.21/0.40 cnf(i_0_20, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.21/0.40 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.21/0.40 cnf(i_0_12, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.21/0.40 cnf(i_0_21, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X2))). % 0.21/0.40 cnf(i_0_22, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X1))). % 0.21/0.40 cnf(i_0_9, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.21/0.40 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.21/0.40 cnf(i_0_8, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.21/0.40 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 8 steps % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(start_rule)). % 0.21/0.40 cnf(i_0_31, plain, (in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_8])). % 0.21/0.40 cnf(i_0_59, plain, (~in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(closure_rule, [i_0_31])). % 0.21/0.40 cnf(i_0_58, plain, (in(esk8_0,set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)))), inference(extension_rule, [i_0_1])). % 0.21/0.40 cnf(i_0_78, plain, (~in(set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk8_0)), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_32, plain, (~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_3])). % 0.21/0.40 cnf(i_0_95, plain, (~in(set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(X6,esk8_0))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.21/0.40 cnf(i_0_103, plain, (set_intersection2(esk6_0,esk7_0)=empty_set), inference(etableau_closure_rule, [i_0_103, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_15, plain, (empty(empty_set))). % 0.21/0.40 cnf(i_0_17, plain, (empty(esk3_0))). % 0.21/0.40 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.21/0.40 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.21/0.40 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.21/0.40 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0))). % 0.21/0.40 cnf(i_0_23, negated_conjecture, (disjoint(esk6_0,esk7_0)|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.40 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.21/0.40 cnf(i_0_11, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.21/0.40 cnf(i_0_20, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.21/0.40 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.21/0.40 cnf(i_0_12, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.21/0.40 cnf(i_0_21, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X2))). % 0.21/0.40 cnf(i_0_22, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X1))). % 0.21/0.40 cnf(i_0_9, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.21/0.40 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.21/0.40 cnf(i_0_8, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.21/0.40 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 8 steps % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(start_rule)). % 0.21/0.40 cnf(i_0_31, plain, (in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_8])). % 0.21/0.40 cnf(i_0_60, plain, (~in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(closure_rule, [i_0_31])). % 0.21/0.40 cnf(i_0_58, plain, (in(esk8_0,set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)))), inference(extension_rule, [i_0_1])). % 0.21/0.40 cnf(i_0_78, plain, (~in(set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk8_0)), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_32, plain, (~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_3])). % 0.21/0.40 cnf(i_0_95, plain, (~in(set_intersection2(set_intersection2(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(X6,esk8_0))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.21/0.40 cnf(i_0_103, plain, (set_intersection2(esk6_0,esk7_0)=empty_set), inference(etableau_closure_rule, [i_0_103, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_15, plain, (empty(empty_set))). % 0.21/0.40 cnf(i_0_17, plain, (empty(esk3_0))). % 0.21/0.40 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.21/0.40 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.21/0.40 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.21/0.40 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0))). % 0.21/0.40 cnf(i_0_23, negated_conjecture, (disjoint(esk6_0,esk7_0)|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.40 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.21/0.40 cnf(i_0_11, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.21/0.40 cnf(i_0_20, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.21/0.40 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.21/0.40 cnf(i_0_12, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.21/0.40 cnf(i_0_21, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X2))). % 0.21/0.40 cnf(i_0_22, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X1))). % 0.21/0.40 cnf(i_0_9, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.21/0.40 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.21/0.40 cnf(i_0_8, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.21/0.40 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 7 steps % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(start_rule)). % 0.21/0.40 cnf(i_0_31, plain, (in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_10])). % 0.21/0.40 cnf(i_0_56, plain, (in(esk8_0,esk6_0)), inference(extension_rule, [i_0_1])). % 0.21/0.40 cnf(i_0_78, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_32, plain, (~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_3])). % 0.21/0.40 cnf(i_0_95, plain, (~in(esk6_0,set_intersection2(X6,esk8_0))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.21/0.40 cnf(i_0_103, plain, (set_intersection2(esk6_0,esk7_0)=empty_set), inference(etableau_closure_rule, [i_0_103, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_15, plain, (empty(empty_set))). % 0.21/0.40 cnf(i_0_17, plain, (empty(esk3_0))). % 0.21/0.40 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.21/0.40 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.21/0.40 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.21/0.40 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~disjoint(esk6_0,esk7_0))). % 0.21/0.40 cnf(i_0_23, negated_conjecture, (disjoint(esk6_0,esk7_0)|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(X1,set_intersection2(esk6_0,esk7_0)))). % 0.21/0.40 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.21/0.40 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.21/0.40 cnf(i_0_11, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.21/0.40 cnf(i_0_20, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.21/0.40 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.21/0.40 cnf(i_0_12, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.21/0.40 cnf(i_0_21, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X2))). % 0.21/0.40 cnf(i_0_22, lemma, (disjoint(X1,X2)|in(esk5_2(X1,X2),X1))). % 0.21/0.40 cnf(i_0_9, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.21/0.40 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.21/0.40 cnf(i_0_8, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.21/0.40 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.21/0.40 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 7 steps % 0.21/0.40 cnf(i_0_24, negated_conjecture, (in(esk8_0,set_intersection2(esk6_0,esk7_0))|~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(start_rule)). % 0.21/0.40 cnf(i_0_31, plain, (in(esk8_0,set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_54, plain, (in(esk8_0,esk7_0)), inference(extension_rule, [i_0_1])). % 0.21/0.40 cnf(i_0_78, plain, (~in(esk7_0,esk8_0)), inference(extension_rule, [i_0_9])). % 0.21/0.40 cnf(i_0_32, plain, (~in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_3])). % 0.21/0.40 cnf(i_0_95, plain, (~in(esk7_0,set_intersection2(X6,esk8_0))), inference(etableau_closure_rule, [i_0_95, ...])). % 0.21/0.40 cnf(i_0_103, plain, (set_intersection2(esk6_0,esk7_0)=empty_set), inference(etableau_closure_rule, [i_0_103, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # Child (30599) has found a proof. % 0.21/0.40 % 0.21/0.40 # Proof search is over... % 0.21/0.40 # Freeing feature tree %------------------------------------------------------------------------------