%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.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 : n028.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 : Mon Jul 18 18:11:04 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/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 : n028.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 May 28 21:37:17 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 # No SInE strategy applied % 0.12/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.34 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.34 # % 0.12/0.34 # Presaturation interreduction done % 0.12/0.34 # Number of axioms: 11 Number of unprocessed: 11 % 0.12/0.34 # Tableaux proof search. % 0.12/0.34 # APR header successfully linked. % 0.12/0.34 # Hello from C++ % 0.12/0.34 # The folding up rule is enabled... % 0.12/0.34 # Local unification is enabled... % 0.12/0.34 # Any saturation attempts will use folding labels... % 0.12/0.34 # 11 beginning clauses after preprocessing and clausification % 0.12/0.34 # Creating start rules for all 2 conjectures. % 0.12/0.34 # There are 2 start rule candidates: % 0.12/0.34 # Found 2 unit axioms. % 0.12/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.34 # 2 start rule tableaux created. % 0.12/0.34 # 9 extension rule candidate clauses % 0.12/0.34 # 2 unit axiom clauses % 0.12/0.34 % 0.12/0.34 # Requested 8, 32 cores available to the main process. % 0.12/0.34 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.34 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.34 # We now have 11 tableaux to operate on % 0.12/0.35 # Closed tableau found in foldup close cycle with 3 folds and 1 closures done. % 0.12/0.35 # There were 0 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 0 total successful branch saturations. % 0.12/0.35 # There were 0 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 0 successful branch saturations after the branch. % 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_2, negated_conjecture, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0))). % 0.12/0.35 cnf(i_0_1, negated_conjecture, (~likes(esk2_0,esk1_0))). % 0.12/0.35 cnf(i_0_5, plain, (alive(X1)|~epred1_6(X2,X3,X4,X1,X5,X6))). % 0.12/0.35 cnf(i_0_8, plain, (food(X1)|~epred1_6(X2,X3,X1,X4,X5,X6))). % 0.12/0.35 cnf(i_0_9, plain, (food(X1)|~epred1_6(X2,X1,X3,X4,X5,X6))). % 0.12/0.35 cnf(i_0_6, plain, (eats(X1,X2)|~epred1_6(X3,X4,X5,X1,X6,X2))). % 0.12/0.35 cnf(i_0_10, plain, (likes(X1,X2)|~epred1_6(X3,X4,X5,X6,X1,X7)|~food(X2))). % 0.12/0.35 cnf(i_0_3, plain, (not_killed_by(X1,X2)|~epred1_6(X3,X4,X5,X6,X7,X8)|~alive(X1))). % 0.12/0.35 cnf(i_0_7, plain, (food(X1)|~epred1_6(X2,X3,X4,X5,X6,X7)|~not_killed_by(X8,X1)|~eats(X8,X1))). % 0.12/0.35 cnf(i_0_4, plain, (eats(X1,X2)|~epred1_6(X1,X3,X4,X5,X6,X7)|~eats(X5,X2))). % 0.12/0.35 cnf(i_0_11, plain, (likes(X1,X2)|~epred1_6(X3,X4,X5,X6,X7,X8)|~eats(X1,X5)|~alive(X1))). % 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.35 # Begin printing tableau % 0.12/0.35 # Found 11 steps % 0.12/0.35 cnf(i_0_2, negated_conjecture, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(start_rule)). % 0.12/0.35 cnf(i_0_13, plain, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(extension_rule, [i_0_7])). % 0.12/0.35 cnf(i_0_53, plain, (food(esk1_0)), inference(extension_rule, [i_0_10])). % 0.12/0.35 cnf(i_0_72, plain, (likes(esk2_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.12/0.35 cnf(i_0_73, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_55, plain, (~not_killed_by(esk3_0,esk1_0)), inference(extension_rule, [i_0_3])). % 0.12/0.35 cnf(i_0_84, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_85, plain, (~alive(esk3_0)), inference(extension_rule, [i_0_5])). % 0.12/0.35 cnf(i_0_87, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_56, plain, (~eats(esk3_0,esk1_0)), inference(extension_rule, [i_0_6])). % 0.12/0.35 cnf(i_0_93, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 # End printing tableau % 0.12/0.35 # SZS output end % 0.12/0.35 # Branches closed with saturation will be marked with an "s" % 0.12/0.35 # Closed tableau found in foldup close cycle with 3 folds and 1 closures done. % 0.12/0.35 # There were 0 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 0 total successful branch saturations. % 0.12/0.35 # There were 0 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 0 successful branch saturations after the branch. % 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_2, negated_conjecture, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0))). % 0.12/0.35 cnf(i_0_1, negated_conjecture, (~likes(esk2_0,esk1_0))). % 0.12/0.35 cnf(i_0_5, plain, (alive(X1)|~epred1_6(X2,X3,X4,X1,X5,X6))). % 0.12/0.35 cnf(i_0_8, plain, (food(X1)|~epred1_6(X2,X3,X1,X4,X5,X6))). % 0.12/0.35 cnf(i_0_9, plain, (food(X1)|~epred1_6(X2,X1,X3,X4,X5,X6))). % 0.12/0.35 cnf(i_0_6, plain, (eats(X1,X2)|~epred1_6(X3,X4,X5,X1,X6,X2))). % 0.12/0.35 cnf(i_0_10, plain, (likes(X1,X2)|~epred1_6(X3,X4,X5,X6,X1,X7)|~food(X2))). % 0.12/0.35 cnf(i_0_3, plain, (not_killed_by(X1,X2)|~epred1_6(X3,X4,X5,X6,X7,X8)|~alive(X1))). % 0.12/0.35 cnf(i_0_7, plain, (food(X1)|~epred1_6(X2,X3,X4,X5,X6,X7)|~not_killed_by(X8,X1)|~eats(X8,X1))). % 0.12/0.35 cnf(i_0_4, plain, (eats(X1,X2)|~epred1_6(X1,X3,X4,X5,X6,X7)|~eats(X5,X2))). % 0.12/0.35 cnf(i_0_11, plain, (likes(X1,X2)|~epred1_6(X3,X4,X5,X6,X7,X8)|~eats(X1,X5)|~alive(X1))). % 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.35 # Begin printing tableau % 0.12/0.35 # Found 11 steps % 0.12/0.35 cnf(i_0_2, negated_conjecture, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(start_rule)). % 0.12/0.35 cnf(i_0_13, plain, (epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(extension_rule, [i_0_3])). % 0.12/0.35 cnf(i_0_50, plain, (not_killed_by(esk3_0,esk1_0)), inference(extension_rule, [i_0_7])). % 0.12/0.35 cnf(i_0_79, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_78, plain, (food(esk1_0)), inference(extension_rule, [i_0_10])). % 0.12/0.35 cnf(i_0_90, plain, (likes(esk2_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.12/0.35 cnf(i_0_91, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_81, plain, (~eats(esk3_0,esk1_0)), inference(extension_rule, [i_0_6])). % 0.12/0.35 cnf(i_0_100, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_52, plain, (~alive(esk3_0)), inference(extension_rule, [i_0_5])). % 0.12/0.35 cnf(i_0_102, plain, (~epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.12/0.35 # End printing tableau % 0.12/0.35 # SZS output end % 0.12/0.35 # Branches closed with saturation will be marked with an "s" % 0.12/0.35 # Child (21095) has found a proof. % 0.12/0.35 % 0.12/0.35 # Proof search is over... % 0.12/0.35 # Freeing feature tree %------------------------------------------------------------------------------