%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.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 : n019.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:16 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.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 : n019.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 22:55:41 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: 23 Number of unprocessed: 23 % 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 # 23 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 11 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 12 extension rule candidate clauses % 0.12/0.36 # 11 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 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 25 tableaux to operate on % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_9, plain, (human(jon))). % 0.12/0.37 cnf(i_0_2, plain, (cat(garfield))). % 0.12/0.37 cnf(i_0_1, plain, (cat(esk1_0))). % 0.12/0.37 cnf(i_0_4, plain, (dog(odie))). % 0.12/0.37 cnf(i_0_3, plain, (dog(esk2_0))). % 0.12/0.37 cnf(i_0_5, plain, (pet(esk3_0))). % 0.12/0.37 cnf(i_0_8, plain, (human(esk4_0))). % 0.12/0.37 cnf(i_0_14, plain, (owner(jon,garfield))). % 0.12/0.37 cnf(i_0_13, plain, (owner(jon,odie))). % 0.12/0.37 cnf(i_0_22, plain, (chased(odie,garfield))). % 0.12/0.37 cnf(i_0_23, negated_conjecture, (~hates(jon,jon))). % 0.12/0.37 cnf(i_0_7, plain, (pet(X1)|~cat(X1))). % 0.12/0.37 cnf(i_0_6, plain, (pet(X1)|~dog(X1))). % 0.12/0.37 cnf(i_0_15, plain, (X1=garfield|~owner(jon,esk6_0))). % 0.12/0.37 cnf(i_0_17, plain, (X1=odie|~owner(jon,esk7_0))). % 0.12/0.37 cnf(i_0_10, plain, (human(owner_of(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_16, plain, (X1=garfield|cat(esk6_0))). % 0.12/0.37 cnf(i_0_18, plain, (X1=odie|dog(esk7_0))). % 0.12/0.37 cnf(i_0_12, plain, (human(esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_11, plain, (owner(X1,esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_20, plain, (owner(owner_of(X1),X1)|~pet(X1))). % 0.12/0.37 cnf(i_0_19, plain, (hates(owner_of(X1),owner_of(X2))|~chased(X2,X1)|~dog(X2)|~cat(X1))). % 0.12/0.37 cnf(i_0_21, plain, (X1=owner_of(X2)|~owner(X1,X2)|~human(X1)|~pet(X2))). % 0.12/0.37 cnf(i_0_54, plain, (X21=X21)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_2, plain, (cat(garfield)), inference(start_rule)). % 0.12/0.37 cnf(i_0_67, plain, (cat(garfield)), inference(extension_rule, [i_0_7])). % 0.12/0.37 cnf(i_0_167, plain, (pet(garfield)), inference(extension_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_175, plain, (human(owner_of(garfield))), inference(etableau_closure_rule, [i_0_175, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_9, plain, (human(jon))). % 0.12/0.37 cnf(i_0_2, plain, (cat(garfield))). % 0.12/0.37 cnf(i_0_1, plain, (cat(esk1_0))). % 0.12/0.37 cnf(i_0_4, plain, (dog(odie))). % 0.12/0.37 cnf(i_0_3, plain, (dog(esk2_0))). % 0.12/0.37 cnf(i_0_5, plain, (pet(esk3_0))). % 0.12/0.37 cnf(i_0_8, plain, (human(esk4_0))). % 0.12/0.37 cnf(i_0_14, plain, (owner(jon,garfield))). % 0.12/0.37 cnf(i_0_13, plain, (owner(jon,odie))). % 0.12/0.37 cnf(i_0_22, plain, (chased(odie,garfield))). % 0.12/0.37 cnf(i_0_23, negated_conjecture, (~hates(jon,jon))). % 0.12/0.37 cnf(i_0_7, plain, (pet(X1)|~cat(X1))). % 0.12/0.37 cnf(i_0_6, plain, (pet(X1)|~dog(X1))). % 0.12/0.37 cnf(i_0_15, plain, (X1=garfield|~owner(jon,esk6_0))). % 0.12/0.37 cnf(i_0_17, plain, (X1=odie|~owner(jon,esk7_0))). % 0.12/0.37 cnf(i_0_10, plain, (human(owner_of(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_16, plain, (X1=garfield|cat(esk6_0))). % 0.12/0.37 cnf(i_0_18, plain, (X1=odie|dog(esk7_0))). % 0.12/0.37 cnf(i_0_12, plain, (human(esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_11, plain, (owner(X1,esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_20, plain, (owner(owner_of(X1),X1)|~pet(X1))). % 0.12/0.37 cnf(i_0_19, plain, (hates(owner_of(X1),owner_of(X2))|~chased(X2,X1)|~dog(X2)|~cat(X1))). % 0.12/0.37 cnf(i_0_21, plain, (X1=owner_of(X2)|~owner(X1,X2)|~human(X1)|~pet(X2))). % 0.12/0.37 cnf(i_0_54, plain, (X21=X21)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_1, plain, (cat(esk1_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_68, plain, (cat(esk1_0)), inference(extension_rule, [i_0_7])). % 0.12/0.37 cnf(i_0_167, plain, (pet(esk1_0)), inference(extension_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_175, plain, (human(owner_of(esk1_0))), inference(etableau_closure_rule, [i_0_175, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_9, plain, (human(jon))). % 0.12/0.37 cnf(i_0_2, plain, (cat(garfield))). % 0.12/0.37 cnf(i_0_1, plain, (cat(esk1_0))). % 0.12/0.37 cnf(i_0_4, plain, (dog(odie))). % 0.12/0.37 cnf(i_0_3, plain, (dog(esk2_0))). % 0.12/0.37 cnf(i_0_5, plain, (pet(esk3_0))). % 0.12/0.37 cnf(i_0_8, plain, (human(esk4_0))). % 0.12/0.37 cnf(i_0_14, plain, (owner(jon,garfield))). % 0.12/0.37 cnf(i_0_13, plain, (owner(jon,odie))). % 0.12/0.37 cnf(i_0_22, plain, (chased(odie,garfield))). % 0.12/0.37 cnf(i_0_23, negated_conjecture, (~hates(jon,jon))). % 0.12/0.37 cnf(i_0_7, plain, (pet(X1)|~cat(X1))). % 0.12/0.37 cnf(i_0_6, plain, (pet(X1)|~dog(X1))). % 0.12/0.37 cnf(i_0_15, plain, (X1=garfield|~owner(jon,esk6_0))). % 0.12/0.37 cnf(i_0_17, plain, (X1=odie|~owner(jon,esk7_0))). % 0.12/0.37 cnf(i_0_10, plain, (human(owner_of(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_16, plain, (X1=garfield|cat(esk6_0))). % 0.12/0.37 cnf(i_0_18, plain, (X1=odie|dog(esk7_0))). % 0.12/0.37 cnf(i_0_12, plain, (human(esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_11, plain, (owner(X1,esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_20, plain, (owner(owner_of(X1),X1)|~pet(X1))). % 0.12/0.37 cnf(i_0_19, plain, (hates(owner_of(X1),owner_of(X2))|~chased(X2,X1)|~dog(X2)|~cat(X1))). % 0.12/0.37 cnf(i_0_21, plain, (X1=owner_of(X2)|~owner(X1,X2)|~human(X1)|~pet(X2))). % 0.12/0.37 cnf(i_0_54, plain, (X21=X21)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_4, plain, (dog(odie)), inference(start_rule)). % 0.12/0.37 cnf(i_0_69, plain, (dog(odie)), inference(extension_rule, [i_0_6])). % 0.12/0.37 cnf(i_0_169, plain, (pet(odie)), inference(extension_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_177, plain, (human(owner_of(odie))), inference(etableau_closure_rule, [i_0_177, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_9, plain, (human(jon))). % 0.12/0.37 cnf(i_0_2, plain, (cat(garfield))). % 0.12/0.37 cnf(i_0_1, plain, (cat(esk1_0))). % 0.12/0.37 cnf(i_0_4, plain, (dog(odie))). % 0.12/0.37 cnf(i_0_3, plain, (dog(esk2_0))). % 0.12/0.37 cnf(i_0_5, plain, (pet(esk3_0))). % 0.12/0.37 cnf(i_0_8, plain, (human(esk4_0))). % 0.12/0.37 cnf(i_0_14, plain, (owner(jon,garfield))). % 0.12/0.37 cnf(i_0_13, plain, (owner(jon,odie))). % 0.12/0.37 cnf(i_0_22, plain, (chased(odie,garfield))). % 0.12/0.37 cnf(i_0_23, negated_conjecture, (~hates(jon,jon))). % 0.12/0.37 cnf(i_0_7, plain, (pet(X1)|~cat(X1))). % 0.12/0.37 cnf(i_0_6, plain, (pet(X1)|~dog(X1))). % 0.12/0.37 cnf(i_0_15, plain, (X1=garfield|~owner(jon,esk6_0))). % 0.12/0.37 cnf(i_0_17, plain, (X1=odie|~owner(jon,esk7_0))). % 0.12/0.37 cnf(i_0_10, plain, (human(owner_of(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_16, plain, (X1=garfield|cat(esk6_0))). % 0.12/0.37 cnf(i_0_18, plain, (X1=odie|dog(esk7_0))). % 0.12/0.37 cnf(i_0_12, plain, (human(esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_11, plain, (owner(X1,esk5_1(X1))|~pet(X1))). % 0.12/0.37 cnf(i_0_20, plain, (owner(owner_of(X1),X1)|~pet(X1))). % 0.12/0.37 cnf(i_0_19, plain, (hates(owner_of(X1),owner_of(X2))|~chased(X2,X1)|~dog(X2)|~cat(X1))). % 0.12/0.37 cnf(i_0_21, plain, (X1=owner_of(X2)|~owner(X1,X2)|~human(X1)|~pet(X2))). % 0.12/0.37 cnf(i_0_54, plain, (X21=X21)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_3, plain, (dog(esk2_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_70, plain, (dog(esk2_0)), inference(extension_rule, [i_0_6])). % 0.12/0.37 cnf(i_0_169, plain, (pet(esk2_0)), inference(extension_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_177, plain, (human(owner_of(esk2_0))), inference(etableau_closure_rule, [i_0_177, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (20874) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------