%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET587+3 : TPTP v8.1.0. Released v2.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:01:01 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SET587+3 : TPTP v8.1.0. Released v2.2.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n010.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jul 9 18:20:30 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.13/0.36 # and selection function SelectUnlessUniqMax. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 19 Number of unprocessed: 17 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 17 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 2 conjectures. % 0.13/0.36 # There are 2 start rule candidates: % 0.13/0.36 # Found 2 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 2 start rule tableaux created. % 0.13/0.36 # 15 extension rule candidate clauses % 0.13/0.36 # 2 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 8 tableaux to operate on % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 2 successful branch saturations after the branch. % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 2 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_17, plain, (subset(X1,X1))). % 0.13/0.37 cnf(i_0_6, plain, (~member(X1,empty_set))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (difference(esk5_0,esk6_0)!=empty_set|~subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (difference(esk5_0,esk6_0)=empty_set|subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_18, plain, (empty(X1)|member(esk4_1(X1),X1))). % 0.13/0.37 cnf(i_0_19, plain, (~empty(X1)|~member(X2,X1))). % 0.13/0.37 cnf(i_0_4, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). % 0.13/0.37 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.13/0.37 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). % 0.13/0.37 cnf(i_0_8, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_7, plain, (subset(X1,X2)|~member(esk2_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_9, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.37 cnf(i_0_3, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). % 0.13/0.37 cnf(i_0_2, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_1, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_13, plain, (X1=X2|member(esk3_2(X1,X2),X1)|member(esk3_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_14, plain, (X1=X2|~member(esk3_2(X1,X2),X2)|~member(esk3_2(X1,X2),X1))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_21, negated_conjecture, (difference(esk5_0,esk6_0)!=empty_set|~subset(esk5_0,esk6_0)), inference(start_rule)). % 0.13/0.37 cnf(i_0_26, plain, (difference(esk5_0,esk6_0)!=empty_set), inference(extension_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_131, plain, (member(esk3_2(difference(esk5_0,esk6_0),empty_set),empty_set)), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_130, plain, (member(esk3_2(difference(esk5_0,esk6_0),empty_set),difference(esk5_0,esk6_0))), inference(extension_rule, [i_0_19])). % 0.13/0.37 cnf(i_0_27, plain, (~subset(esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_27, ...])). % 0.13/0.37 cnf(i_0_141, plain, (~empty(difference(esk5_0,esk6_0))), inference(etableau_closure_rule, [i_0_141, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_17, plain, (subset(X1,X1))). % 0.13/0.37 cnf(i_0_6, plain, (~member(X1,empty_set))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (difference(esk5_0,esk6_0)!=empty_set|~subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (difference(esk5_0,esk6_0)=empty_set|subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_18, plain, (empty(X1)|member(esk4_1(X1),X1))). % 0.13/0.37 cnf(i_0_19, plain, (~empty(X1)|~member(X2,X1))). % 0.13/0.37 cnf(i_0_4, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). % 0.13/0.37 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.13/0.37 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). % 0.13/0.37 cnf(i_0_8, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_7, plain, (subset(X1,X2)|~member(esk2_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_9, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.37 cnf(i_0_3, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). % 0.13/0.37 cnf(i_0_2, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_1, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_13, plain, (X1=X2|member(esk3_2(X1,X2),X1)|member(esk3_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_14, plain, (X1=X2|~member(esk3_2(X1,X2),X2)|~member(esk3_2(X1,X2),X1))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_21, negated_conjecture, (difference(esk5_0,esk6_0)!=empty_set|~subset(esk5_0,esk6_0)), inference(start_rule)). % 0.13/0.37 cnf(i_0_26, plain, (difference(esk5_0,esk6_0)!=empty_set), inference(extension_rule, [i_0_1])). % 0.13/0.37 cnf(i_0_128, plain, (member(esk1_2(difference(esk5_0,esk6_0),empty_set),empty_set)), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_127, plain, (member(esk1_2(difference(esk5_0,esk6_0),empty_set),difference(esk5_0,esk6_0))), inference(extension_rule, [i_0_19])). % 0.13/0.37 cnf(i_0_27, plain, (~subset(esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_27, ...])). % 0.13/0.37 cnf(i_0_141, plain, (~empty(difference(esk5_0,esk6_0))), inference(etableau_closure_rule, [i_0_141, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_17, plain, (subset(X1,X1))). % 0.13/0.37 cnf(i_0_6, plain, (~member(X1,empty_set))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (difference(esk5_0,esk6_0)!=empty_set|~subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (difference(esk5_0,esk6_0)=empty_set|subset(esk5_0,esk6_0))). % 0.13/0.37 cnf(i_0_18, plain, (empty(X1)|member(esk4_1(X1),X1))). % 0.13/0.37 cnf(i_0_19, plain, (~empty(X1)|~member(X2,X1))). % 0.13/0.37 cnf(i_0_4, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). % 0.13/0.37 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.13/0.37 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). % 0.13/0.37 cnf(i_0_8, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_7, plain, (subset(X1,X2)|~member(esk2_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_9, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.37 cnf(i_0_3, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). % 0.13/0.37 cnf(i_0_2, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_1, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_13, plain, (X1=X2|member(esk3_2(X1,X2),X1)|member(esk3_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_14, plain, (X1=X2|~member(esk3_2(X1,X2),X2)|~member(esk3_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_176, plain, (X33=X33)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_176, plain, (esk4_1(empty_set)=esk4_1(empty_set)), inference(start_rule)). % 0.13/0.37 cnf(i_0_223, plain, (esk4_1(empty_set)=esk4_1(empty_set)), inference(extension_rule, [i_0_180])). % 0.13/0.37 cnf(i_0_268, plain, (member(esk4_1(empty_set),empty_set)), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_270, plain, ($false), inference(closure_rule, [i_0_176])). % 0.13/0.37 cnf(i_0_271, plain, (~member(esk4_1(empty_set),empty_set)), inference(extension_rule, [i_0_18])). % 0.13/0.37 cnf(i_0_272, plain, (empty(empty_set)), inference(etableau_closure_rule, [i_0_272, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (19386) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------