%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET929+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 : n015.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:56 EDT 2022 % Result : Theorem 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET929+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n015.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jul 9 21:57:07 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 14 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 3 conjectures. % 0.12/0.36 # There are 3 start rule candidates: % 0.12/0.36 # Found 5 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 3 start rule tableaux created. % 0.12/0.36 # 9 extension rule candidate clauses % 0.12/0.36 # 5 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 11 tableaux to operate on % 0.18/0.36 # There were 2 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 2 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 2 successful branch saturations after the branch. % 0.18/0.36 # There were 2 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 2 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 2 successful branch saturations after the branch. % 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_3, plain, (empty(empty_set))). % 0.18/0.36 cnf(i_0_4, plain, (empty(esk1_0))). % 0.18/0.36 cnf(i_0_6, plain, (subset(X1,X1))). % 0.18/0.36 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.36 cnf(i_0_5, plain, (~empty(esk2_0))). % 0.18/0.36 cnf(i_0_14, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set|~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0))). % 0.18/0.36 cnf(i_0_12, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.36 cnf(i_0_8, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.18/0.36 cnf(i_0_10, plain, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))). % 0.18/0.36 cnf(i_0_11, plain, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))). % 0.18/0.36 cnf(i_0_7, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.18/0.36 cnf(i_0_9, plain, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 6 steps % 0.18/0.36 cnf(i_0_12, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0)), inference(start_rule)). % 0.18/0.36 cnf(i_0_16, plain, (in(esk4_0,esk5_0)), inference(extension_rule, [i_0_9])). % 0.18/0.36 cnf(i_0_54, plain, (~in(esk4_0,esk5_0)), inference(closure_rule, [i_0_16])). % 0.18/0.36 cnf(i_0_52, plain, (subset(unordered_pair(esk4_0,esk4_0),esk5_0)), inference(extension_rule, [i_0_7])). % 0.18/0.36 cnf(i_0_15, plain, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_15, ...])). % 0.18/0.36 cnf(i_0_110, plain, (set_difference(unordered_pair(esk4_0,esk4_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_110, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # There were 2 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 2 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 2 successful branch saturations after the branch. % 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_3, plain, (empty(empty_set))). % 0.18/0.36 cnf(i_0_4, plain, (empty(esk1_0))). % 0.18/0.36 cnf(i_0_6, plain, (subset(X1,X1))). % 0.18/0.36 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.36 cnf(i_0_5, plain, (~empty(esk2_0))). % 0.18/0.36 cnf(i_0_14, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set|~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0))). % 0.18/0.36 cnf(i_0_12, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.36 cnf(i_0_8, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.18/0.36 cnf(i_0_10, plain, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))). % 0.18/0.36 cnf(i_0_11, plain, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))). % 0.18/0.36 cnf(i_0_7, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.18/0.36 cnf(i_0_9, plain, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 6 steps % 0.18/0.36 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0)), inference(start_rule)). % 0.18/0.36 cnf(i_0_18, plain, (in(esk3_0,esk5_0)), inference(extension_rule, [i_0_9])). % 0.18/0.36 cnf(i_0_94, plain, (~in(esk3_0,esk5_0)), inference(closure_rule, [i_0_18])). % 0.18/0.36 cnf(i_0_92, plain, (subset(unordered_pair(esk3_0,esk3_0),esk5_0)), inference(extension_rule, [i_0_7])). % 0.18/0.36 cnf(i_0_17, plain, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_17, ...])). % 0.18/0.36 cnf(i_0_110, plain, (set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_110, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # There were 2 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 2 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 2 successful branch saturations after the branch. % 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_3, plain, (empty(empty_set))). % 0.18/0.36 cnf(i_0_4, plain, (empty(esk1_0))). % 0.18/0.36 cnf(i_0_6, plain, (subset(X1,X1))). % 0.18/0.36 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.36 cnf(i_0_5, plain, (~empty(esk2_0))). % 0.18/0.36 cnf(i_0_14, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set|~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0))). % 0.18/0.36 cnf(i_0_12, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.36 cnf(i_0_8, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.18/0.36 cnf(i_0_10, plain, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))). % 0.18/0.36 cnf(i_0_11, plain, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))). % 0.18/0.36 cnf(i_0_7, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.18/0.36 cnf(i_0_9, plain, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 5 steps % 0.18/0.36 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0)), inference(start_rule)). % 0.18/0.36 cnf(i_0_17, plain, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set), inference(extension_rule, [i_0_8])). % 0.18/0.36 cnf(i_0_64, plain, (subset(unordered_pair(esk3_0,esk4_0),esk5_0)), inference(extension_rule, [i_0_10])). % 0.18/0.36 cnf(i_0_18, plain, (in(esk3_0,esk5_0)), inference(etableau_closure_rule, [i_0_18, ...])). % 0.18/0.36 cnf(i_0_106, plain, (in(esk4_0,esk5_0)), inference(etableau_closure_rule, [i_0_106, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (25488) has found a proof. % 0.18/0.37 % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_3, plain, (empty(empty_set))). % 0.18/0.37 cnf(i_0_4, plain, (empty(esk1_0))). % 0.18/0.37 cnf(i_0_6, plain, (subset(X1,X1))). % 0.18/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.37 cnf(i_0_5, plain, (~empty(esk2_0))). % 0.18/0.37 cnf(i_0_14, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set|~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0))). % 0.18/0.37 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0))). % 0.18/0.37 cnf(i_0_12, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0))). % 0.18/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.37 cnf(i_0_8, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.18/0.37 cnf(i_0_10, plain, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))). % 0.18/0.37 cnf(i_0_11, plain, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))). % 0.18/0.37 cnf(i_0_7, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.18/0.37 cnf(i_0_9, plain, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_13, negated_conjecture, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0)), inference(start_rule)). % 0.18/0.37 cnf(i_0_18, plain, (in(esk3_0,esk5_0)), inference(extension_rule, [i_0_9])). % 0.18/0.37 cnf(i_0_93, plain, (~in(esk3_0,esk5_0)), inference(closure_rule, [i_0_18])). % 0.18/0.37 cnf(i_0_92, plain, (subset(unordered_pair(esk3_0,esk3_0),esk5_0)), inference(extension_rule, [i_0_7])). % 0.18/0.37 cnf(i_0_17, plain, (set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_17, ...])). % 0.18/0.37 cnf(i_0_110, plain, (set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)=empty_set), inference(etableau_closure_rule, [i_0_110, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------