%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU148+3 : 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 : n004.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:24:11 EDT 2022 % Result : Theorem 0.11s 0.36s % Output : CNFRefutation 0.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU148+3 : TPTP v8.1.0. Released v3.2.0. % 0.11/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.32 % Computer : n004.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Sun Jun 19 12:47:53 EDT 2022 % 0.11/0.32 % CPUTime : % 0.11/0.35 # No SInE strategy applied % 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.35 # % 0.11/0.35 # Presaturation interreduction done % 0.11/0.35 # Number of axioms: 15 Number of unprocessed: 14 % 0.11/0.35 # Tableaux proof search. % 0.11/0.35 # APR header successfully linked. % 0.11/0.35 # Hello from C++ % 0.11/0.35 # The folding up rule is enabled... % 0.11/0.35 # Local unification is enabled... % 0.11/0.35 # Any saturation attempts will use folding labels... % 0.11/0.35 # 14 beginning clauses after preprocessing and clausification % 0.11/0.35 # Creating start rules for all 2 conjectures. % 0.11/0.35 # There are 2 start rule candidates: % 0.11/0.35 # Found 9 unit axioms. % 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.35 # 2 start rule tableaux created. % 0.11/0.35 # 5 extension rule candidate clauses % 0.11/0.35 # 9 unit axiom clauses % 0.11/0.35 % 0.11/0.35 # Requested 8, 32 cores available to the main process. % 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 2 % 0.11/0.35 # Creating equality axioms % 0.11/0.35 # Ran out of tableaux, making start rules for all clauses % 0.11/0.35 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.11/0.35 # We now have 16 tableaux to operate on % 0.11/0.36 # There were 1 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 1 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 1 successful branch saturations after the branch. % 0.11/0.36 # There were 1 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 1 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 1 successful branch saturations after the branch. % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_15, negated_conjecture, (subset(singleton(esk4_0),singleton(esk5_0)))). % 0.11/0.36 cnf(i_0_6, plain, (empty(empty_set))). % 0.11/0.36 cnf(i_0_11, plain, (empty(esk2_0))). % 0.11/0.36 cnf(i_0_13, plain, (subset(X1,X1))). % 0.11/0.36 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))). % 0.11/0.36 cnf(i_0_4, plain, (in(X1,singleton(X1)))). % 0.11/0.36 cnf(i_0_14, negated_conjecture, (esk5_0!=esk4_0)). % 0.11/0.36 cnf(i_0_7, plain, (singleton(X1)!=empty_set)). % 0.11/0.36 cnf(i_0_12, plain, (~empty(esk3_0))). % 0.11/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.11/0.36 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.11/0.36 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.11/0.36 cnf(i_0_75, plain, (X21=X21)). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 7 steps % 0.11/0.36 cnf(i_0_15, negated_conjecture, (subset(singleton(esk4_0),singleton(esk5_0))), inference(start_rule)). % 0.11/0.36 cnf(i_0_83, plain, (subset(singleton(esk4_0),singleton(esk5_0))), inference(extension_rule, [i_0_82])). % 0.11/0.36 cnf(i_0_136, plain, ($false), inference(closure_rule, [i_0_75])). % 0.11/0.36 cnf(i_0_135, plain, (subset(singleton(esk4_0),singleton(esk5_0))), inference(extension_rule, [i_0_10])). % 0.11/0.36 cnf(i_0_137, plain, ($false), inference(closure_rule, [i_0_75])). % 0.11/0.36 cnf(i_0_142, plain, (singleton(esk4_0)=empty_set), inference(closure_rule, [i_0_7])). % 0.11/0.36 cnf(i_0_141, plain, (singleton(esk4_0)=singleton(esk5_0)), inference(etableau_closure_rule, [i_0_141, ...])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_15, negated_conjecture, (subset(singleton(esk4_0),singleton(esk5_0)))). % 0.11/0.36 cnf(i_0_6, plain, (empty(empty_set))). % 0.11/0.36 cnf(i_0_11, plain, (empty(esk2_0))). % 0.11/0.36 cnf(i_0_13, plain, (subset(X1,X1))). % 0.11/0.36 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))). % 0.11/0.36 cnf(i_0_4, plain, (in(X1,singleton(X1)))). % 0.11/0.36 cnf(i_0_14, negated_conjecture, (esk5_0!=esk4_0)). % 0.11/0.36 cnf(i_0_7, plain, (singleton(X1)!=empty_set)). % 0.11/0.36 cnf(i_0_12, plain, (~empty(esk3_0))). % 0.11/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.11/0.36 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.11/0.36 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.11/0.36 cnf(i_0_75, plain, (X21=X21)). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 6 steps % 0.11/0.36 cnf(i_0_15, negated_conjecture, (subset(singleton(esk4_0),singleton(esk5_0))), inference(start_rule)). % 0.11/0.36 cnf(i_0_83, plain, (subset(singleton(esk4_0),singleton(esk5_0))), inference(extension_rule, [i_0_10])). % 0.11/0.36 cnf(i_0_109, plain, (singleton(esk4_0)=empty_set), inference(closure_rule, [i_0_7])). % 0.11/0.36 cnf(i_0_108, plain, (singleton(esk4_0)=singleton(esk5_0)), inference(extension_rule, [i_0_78])). % 0.11/0.36 cnf(i_0_156, plain, (singleton(esk4_0)=empty_set), inference(closure_rule, [i_0_7])). % 0.11/0.36 cnf(i_0_158, plain, (singleton(esk5_0)!=empty_set), inference(etableau_closure_rule, [i_0_158, ...])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # There were 1 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 1 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 1 successful branch saturations after the branch. % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_15, negated_conjecture, (subset(singleton(esk4_0),singleton(esk5_0)))). % 0.11/0.36 cnf(i_0_6, plain, (empty(empty_set))). % 0.11/0.36 cnf(i_0_11, plain, (empty(esk2_0))). % 0.11/0.36 cnf(i_0_13, plain, (subset(X1,X1))). % 0.11/0.36 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))). % 0.11/0.36 cnf(i_0_4, plain, (in(X1,singleton(X1)))). % 0.11/0.36 cnf(i_0_14, negated_conjecture, (esk5_0!=esk4_0)). % 0.11/0.36 cnf(i_0_7, plain, (singleton(X1)!=empty_set)). % 0.11/0.36 cnf(i_0_12, plain, (~empty(esk3_0))). % 0.11/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.11/0.36 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.11/0.36 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.11/0.36 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.11/0.36 cnf(i_0_75, plain, (X21=X21)). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 6 steps % 0.11/0.36 cnf(i_0_14, negated_conjecture, (esk5_0!=esk4_0), inference(start_rule)). % 0.11/0.36 cnf(i_0_89, plain, (esk5_0!=esk4_0), inference(extension_rule, [i_0_5])). % 0.11/0.36 cnf(i_0_145, plain, (~in(esk5_0,singleton(esk4_0))), inference(extension_rule, [i_0_79])). % 0.11/0.36 cnf(i_0_165, plain, ($false), inference(closure_rule, [i_0_75])). % 0.11/0.36 cnf(i_0_167, plain, (~in(esk5_0,singleton(esk5_0))), inference(closure_rule, [i_0_4])). % 0.11/0.36 cnf(i_0_166, plain, (singleton(esk5_0)!=singleton(esk4_0)), inference(etableau_closure_rule, [i_0_166, ...])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # Child (5980) has found a proof. % 0.11/0.36 % 0.11/0.36 # Proof search is over... % 0.11/0.36 # Freeing feature tree %------------------------------------------------------------------------------