%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET906+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 : n016.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:03:43 EDT 2022 % Result : Theorem 0.21s 0.39s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SET906+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.14/0.36 % Computer : n016.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 Jul 10 23:03:42 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y % 0.14/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.39 # % 0.14/0.39 # Number of axioms: 26 Number of unprocessed: 26 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 26 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 2 conjectures. % 0.14/0.39 # There are 2 start rule candidates: % 0.14/0.39 # Found 8 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 2 start rule tableaux created. % 0.14/0.39 # 18 extension rule candidate clauses % 0.14/0.39 # 8 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.14/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 8 tableaux to operate on % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 1 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 1 successful branch saturations after the branch. % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_22, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_23, plain, (~empty(esk5_0))). % 0.21/0.39 cnf(i_0_24, plain, (subset(X1,X1))). % 0.21/0.39 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)). % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0))). % 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.21/0.39 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.21/0.39 cnf(i_0_7, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X4,X2))). % 0.21/0.39 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X2,X4))). % 0.21/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_9, plain, (X1=X4|X1=X3|X2!=unordered_pair(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.21/0.39 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.21/0.39 cnf(i_0_17, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.21/0.39 cnf(i_0_18, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.21/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_14, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_26, negated_conjecture, (subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.21/0.39 cnf(i_0_4, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)=X2|esk1_3(X1,X2,X3)=X1|in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_5, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X2|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_6, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X1|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.21/0.39 cnf(i_0_12, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 7 steps % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0)), inference(start_rule)). % 0.21/0.39 cnf(i_0_28, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_15])). % 0.21/0.39 cnf(i_0_109, plain, (in(esk6_0,esk8_0)), inference(closure_rule, [i_0_25])). % 0.21/0.39 cnf(i_0_111, plain, (set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0))!=set_union2(esk8_0,esk8_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_112, plain, (~in(esk6_0,set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0)))), inference(extension_rule, [i_0_7])). % 0.21/0.39 cnf(i_0_136, plain, (esk6_0!=set_union2(esk6_0,esk6_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_137, plain, (set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0))!=unordered_pair(X8,set_union2(esk6_0,esk6_0))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 1 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 1 successful branch saturations after the branch. % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_22, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_23, plain, (~empty(esk5_0))). % 0.21/0.39 cnf(i_0_24, plain, (subset(X1,X1))). % 0.21/0.39 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)). % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0))). % 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.21/0.39 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.21/0.39 cnf(i_0_7, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X4,X2))). % 0.21/0.39 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X2,X4))). % 0.21/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_9, plain, (X1=X4|X1=X3|X2!=unordered_pair(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.21/0.39 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.21/0.39 cnf(i_0_17, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.21/0.39 cnf(i_0_18, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.21/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_14, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_26, negated_conjecture, (subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.21/0.39 cnf(i_0_4, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)=X2|esk1_3(X1,X2,X3)=X1|in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_5, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X2|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_6, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X1|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.21/0.39 cnf(i_0_12, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 7 steps % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0)), inference(start_rule)). % 0.21/0.39 cnf(i_0_28, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_15])). % 0.21/0.39 cnf(i_0_110, plain, (in(esk6_0,esk8_0)), inference(closure_rule, [i_0_25])). % 0.21/0.39 cnf(i_0_111, plain, (set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0))!=set_union2(esk8_0,esk8_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_112, plain, (~in(esk6_0,set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0)))), inference(extension_rule, [i_0_7])). % 0.21/0.39 cnf(i_0_136, plain, (esk6_0!=set_union2(esk6_0,esk6_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_137, plain, (set_union2(set_union2(esk8_0,esk8_0),set_union2(esk8_0,esk8_0))!=unordered_pair(X8,set_union2(esk6_0,esk6_0))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 1 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 1 successful branch saturations after the branch. % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_22, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_23, plain, (~empty(esk5_0))). % 0.21/0.39 cnf(i_0_24, plain, (subset(X1,X1))). % 0.21/0.39 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)). % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0))). % 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.21/0.39 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.21/0.39 cnf(i_0_7, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X4,X2))). % 0.21/0.39 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X2,X4))). % 0.21/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_9, plain, (X1=X4|X1=X3|X2!=unordered_pair(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.21/0.39 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.21/0.39 cnf(i_0_17, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.21/0.39 cnf(i_0_18, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.21/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_14, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_26, negated_conjecture, (subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.21/0.39 cnf(i_0_4, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)=X2|esk1_3(X1,X2,X3)=X1|in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_5, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X2|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_6, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X1|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.21/0.39 cnf(i_0_12, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 6 steps % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0)), inference(start_rule)). % 0.21/0.39 cnf(i_0_28, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_13])). % 0.21/0.39 cnf(i_0_105, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_7])). % 0.21/0.39 cnf(i_0_104, plain, (set_union2(esk8_0,esk8_0)!=esk8_0), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_136, plain, (esk6_0!=set_union2(esk6_0,esk6_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_137, plain, (esk8_0!=unordered_pair(X10,set_union2(esk6_0,esk6_0))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 1 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 1 successful branch saturations after the branch. % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 1 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 1 successful branch saturations after the branch. % 0.21/0.39 # Child (15382) has found a proof. % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_22, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_23, plain, (~empty(esk5_0))). % 0.21/0.39 cnf(i_0_24, plain, (subset(X1,X1))). % 0.21/0.39 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)). % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0))). % 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.21/0.39 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.21/0.39 cnf(i_0_7, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X4,X2))). % 0.21/0.39 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X2,X4))). % 0.21/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_9, plain, (X1=X4|X1=X3|X2!=unordered_pair(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.21/0.39 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.21/0.39 cnf(i_0_17, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.21/0.39 cnf(i_0_18, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.21/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_14, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_26, negated_conjecture, (subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.21/0.39 cnf(i_0_4, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)=X2|esk1_3(X1,X2,X3)=X1|in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_5, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X2|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_6, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X1|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.21/0.39 cnf(i_0_12, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 6 steps % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0)), inference(start_rule)). % 0.21/0.39 cnf(i_0_28, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_14])). % 0.21/0.39 cnf(i_0_108, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_7])). % 0.21/0.39 cnf(i_0_107, plain, (set_union2(esk8_0,esk8_0)!=esk8_0), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_136, plain, (esk6_0!=set_union2(esk6_0,esk6_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_137, plain, (esk8_0!=unordered_pair(X10,set_union2(esk6_0,esk6_0))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 % 0.21/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_22, plain, (empty(esk4_0))). % 0.21/0.39 cnf(i_0_23, plain, (~empty(esk5_0))). % 0.21/0.39 cnf(i_0_24, plain, (subset(X1,X1))). % 0.21/0.39 cnf(i_0_21, plain, (set_union2(X1,X1)=X1)). % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0))). % 0.21/0.39 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.21/0.39 cnf(i_0_3, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.21/0.39 cnf(i_0_7, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X4,X2))). % 0.21/0.39 cnf(i_0_8, plain, (in(X1,X3)|X1!=X2|X3!=unordered_pair(X2,X4))). % 0.21/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_9, plain, (X1=X4|X1=X3|X2!=unordered_pair(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_20, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.21/0.39 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.21/0.39 cnf(i_0_17, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.21/0.39 cnf(i_0_18, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.21/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_14, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_26, negated_conjecture, (subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0))). % 0.21/0.39 cnf(i_0_15, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.21/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.21/0.39 cnf(i_0_4, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)=X2|esk1_3(X1,X2,X3)=X1|in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_5, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X2|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_6, plain, (X3=unordered_pair(X1,X2)|esk1_3(X1,X2,X3)!=X1|~in(esk1_3(X1,X2,X3),X3))). % 0.21/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.21/0.39 cnf(i_0_12, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 6 steps % 0.21/0.39 cnf(i_0_25, negated_conjecture, (~in(esk6_0,esk8_0)), inference(start_rule)). % 0.21/0.39 cnf(i_0_28, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_18])). % 0.21/0.39 cnf(i_0_101, plain, (~in(esk6_0,esk8_0)), inference(extension_rule, [i_0_7])). % 0.21/0.39 cnf(i_0_102, plain, (~subset(esk8_0,esk8_0)), inference(closure_rule, [i_0_24])). % 0.21/0.39 cnf(i_0_136, plain, (esk6_0!=set_union2(esk6_0,esk6_0)), inference(closure_rule, [i_0_21])). % 0.21/0.39 cnf(i_0_137, plain, (esk8_0!=unordered_pair(X8,set_union2(esk6_0,esk6_0))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # Proof search is over... % 0.21/0.39 # Freeing feature tree %------------------------------------------------------------------------------