%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ031+2 : 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:00 EDT 2022 % Result : Theorem 0.18s 0.40s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PUZ031+2 : TPTP v8.1.0. Released v4.1.0. % 0.07/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 21:54:11 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: 26 Number of unprocessed: 26 % 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.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 26 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 6 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 20 extension rule candidate clauses % 0.12/0.37 # 6 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 9 tableaux to operate on % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.18/0.39 # Ran out of tableaux, making start rules for all clauses % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_11, plain, (grain(esk6_0))). % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0))). % 0.18/0.40 cnf(i_0_2, plain, (fox(esk2_0))). % 0.18/0.40 cnf(i_0_3, plain, (bird(esk3_0))). % 0.18/0.40 cnf(i_0_4, plain, (caterpillar(esk4_0))). % 0.18/0.40 cnf(i_0_5, plain, (snail(esk5_0))). % 0.18/0.40 cnf(i_0_12, plain, (plant(X1)|~grain(X1))). % 0.18/0.40 cnf(i_0_6, plain, (animal(X1)|~wolf(X1))). % 0.18/0.40 cnf(i_0_7, plain, (animal(X1)|~fox(X1))). % 0.18/0.40 cnf(i_0_8, plain, (animal(X1)|~bird(X1))). % 0.18/0.40 cnf(i_0_9, plain, (animal(X1)|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_10, plain, (animal(X1)|~snail(X1))). % 0.18/0.40 cnf(i_0_19, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_23, plain, (plant(esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_25, plain, (plant(esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_24, plain, (eats(X1,esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_15, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_18, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_14, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))). % 0.18/0.40 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))). % 0.18/0.40 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))). % 0.18/0.40 cnf(i_0_13, plain, (eats(X1,X2)|eats(X1,X3)|~much_smaller(X3,X1)|~eats(X3,X4)|~plant(X4)|~plant(X2)|~animal(X3)|~animal(X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 12 steps % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0)), inference(start_rule)). % 0.18/0.40 cnf(i_0_533, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_18])). % 0.18/0.40 cnf(i_0_3465, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_2])). % 0.18/0.40 cnf(i_0_3464, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_3475, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3464])). % 0.18/0.40 cnf(i_0_3476, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3476, ...])). % 0.18/0.40 cnf(i_0_3479, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3479, ...])). % 0.18/0.40 cnf(i_0_3480, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3480, ...])). % 0.18/0.40 cnf(i_0_3481, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3481, ...])). % 0.18/0.40 cnf(i_0_3477, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_22])). % 0.18/0.40 cnf(i_0_3478, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3478, ...])). % 0.18/0.40 cnf(i_0_3612, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3612, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_11, plain, (grain(esk6_0))). % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0))). % 0.18/0.40 cnf(i_0_2, plain, (fox(esk2_0))). % 0.18/0.40 cnf(i_0_3, plain, (bird(esk3_0))). % 0.18/0.40 cnf(i_0_4, plain, (caterpillar(esk4_0))). % 0.18/0.40 cnf(i_0_5, plain, (snail(esk5_0))). % 0.18/0.40 cnf(i_0_12, plain, (plant(X1)|~grain(X1))). % 0.18/0.40 cnf(i_0_6, plain, (animal(X1)|~wolf(X1))). % 0.18/0.40 cnf(i_0_7, plain, (animal(X1)|~fox(X1))). % 0.18/0.40 cnf(i_0_8, plain, (animal(X1)|~bird(X1))). % 0.18/0.40 cnf(i_0_9, plain, (animal(X1)|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_10, plain, (animal(X1)|~snail(X1))). % 0.18/0.40 cnf(i_0_19, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_23, plain, (plant(esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_25, plain, (plant(esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_24, plain, (eats(X1,esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_15, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_18, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_14, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))). % 0.18/0.40 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))). % 0.18/0.40 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))). % 0.18/0.40 cnf(i_0_13, plain, (eats(X1,X2)|eats(X1,X3)|~much_smaller(X3,X1)|~eats(X3,X4)|~plant(X4)|~plant(X2)|~animal(X3)|~animal(X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 12 steps % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0)), inference(start_rule)). % 0.18/0.40 cnf(i_0_484, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_18])). % 0.18/0.40 cnf(i_0_3389, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_2])). % 0.18/0.40 cnf(i_0_3388, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_3399, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3388])). % 0.18/0.40 cnf(i_0_3400, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3400, ...])). % 0.18/0.40 cnf(i_0_3403, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3403, ...])). % 0.18/0.40 cnf(i_0_3404, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3404, ...])). % 0.18/0.40 cnf(i_0_3405, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3405, ...])). % 0.18/0.40 cnf(i_0_3401, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_22])). % 0.18/0.40 cnf(i_0_3402, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3402, ...])). % 0.18/0.40 cnf(i_0_3549, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3549, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_11, plain, (grain(esk6_0))). % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0))). % 0.18/0.40 cnf(i_0_2, plain, (fox(esk2_0))). % 0.18/0.40 cnf(i_0_3, plain, (bird(esk3_0))). % 0.18/0.40 cnf(i_0_4, plain, (caterpillar(esk4_0))). % 0.18/0.40 cnf(i_0_5, plain, (snail(esk5_0))). % 0.18/0.40 cnf(i_0_12, plain, (plant(X1)|~grain(X1))). % 0.18/0.40 cnf(i_0_6, plain, (animal(X1)|~wolf(X1))). % 0.18/0.40 cnf(i_0_7, plain, (animal(X1)|~fox(X1))). % 0.18/0.40 cnf(i_0_8, plain, (animal(X1)|~bird(X1))). % 0.18/0.40 cnf(i_0_9, plain, (animal(X1)|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_10, plain, (animal(X1)|~snail(X1))). % 0.18/0.40 cnf(i_0_19, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_23, plain, (plant(esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_25, plain, (plant(esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_24, plain, (eats(X1,esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_15, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_18, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_14, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))). % 0.18/0.40 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))). % 0.18/0.40 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))). % 0.18/0.40 cnf(i_0_13, plain, (eats(X1,X2)|eats(X1,X3)|~much_smaller(X3,X1)|~eats(X3,X4)|~plant(X4)|~plant(X2)|~animal(X3)|~animal(X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 12 steps % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0)), inference(start_rule)). % 0.18/0.40 cnf(i_0_476, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_18])). % 0.18/0.40 cnf(i_0_3408, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_2])). % 0.18/0.40 cnf(i_0_3407, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_3418, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3407])). % 0.18/0.40 cnf(i_0_3419, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3419, ...])). % 0.18/0.40 cnf(i_0_3422, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3422, ...])). % 0.18/0.40 cnf(i_0_3423, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3423, ...])). % 0.18/0.40 cnf(i_0_3424, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3424, ...])). % 0.18/0.40 cnf(i_0_3420, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_22])). % 0.18/0.40 cnf(i_0_3421, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3421, ...])). % 0.18/0.40 cnf(i_0_3555, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3555, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_11, plain, (grain(esk6_0))). % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0))). % 0.18/0.40 cnf(i_0_2, plain, (fox(esk2_0))). % 0.18/0.40 cnf(i_0_3, plain, (bird(esk3_0))). % 0.18/0.40 cnf(i_0_4, plain, (caterpillar(esk4_0))). % 0.18/0.40 cnf(i_0_5, plain, (snail(esk5_0))). % 0.18/0.40 cnf(i_0_12, plain, (plant(X1)|~grain(X1))). % 0.18/0.40 cnf(i_0_6, plain, (animal(X1)|~wolf(X1))). % 0.18/0.40 cnf(i_0_7, plain, (animal(X1)|~fox(X1))). % 0.18/0.40 cnf(i_0_8, plain, (animal(X1)|~bird(X1))). % 0.18/0.40 cnf(i_0_9, plain, (animal(X1)|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_10, plain, (animal(X1)|~snail(X1))). % 0.18/0.40 cnf(i_0_19, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_23, plain, (plant(esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_25, plain, (plant(esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_24, plain, (eats(X1,esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_15, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_18, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_14, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))). % 0.18/0.40 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))). % 0.18/0.40 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))). % 0.18/0.40 cnf(i_0_13, plain, (eats(X1,X2)|eats(X1,X3)|~much_smaller(X3,X1)|~eats(X3,X4)|~plant(X4)|~plant(X2)|~animal(X3)|~animal(X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 12 steps % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0)), inference(start_rule)). % 0.18/0.40 cnf(i_0_590, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_18])). % 0.18/0.40 cnf(i_0_3522, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_2])). % 0.18/0.40 cnf(i_0_3521, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_3532, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3521])). % 0.18/0.40 cnf(i_0_3533, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3533, ...])). % 0.18/0.40 cnf(i_0_3536, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3536, ...])). % 0.18/0.40 cnf(i_0_3537, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3537, ...])). % 0.18/0.40 cnf(i_0_3538, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3538, ...])). % 0.18/0.40 cnf(i_0_3534, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_22])). % 0.18/0.40 cnf(i_0_3535, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3535, ...])). % 0.18/0.40 cnf(i_0_3669, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3669, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_11, plain, (grain(esk6_0))). % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0))). % 0.18/0.40 cnf(i_0_2, plain, (fox(esk2_0))). % 0.18/0.40 cnf(i_0_3, plain, (bird(esk3_0))). % 0.18/0.40 cnf(i_0_4, plain, (caterpillar(esk4_0))). % 0.18/0.40 cnf(i_0_5, plain, (snail(esk5_0))). % 0.18/0.40 cnf(i_0_12, plain, (plant(X1)|~grain(X1))). % 0.18/0.40 cnf(i_0_6, plain, (animal(X1)|~wolf(X1))). % 0.18/0.40 cnf(i_0_7, plain, (animal(X1)|~fox(X1))). % 0.18/0.40 cnf(i_0_8, plain, (animal(X1)|~bird(X1))). % 0.18/0.40 cnf(i_0_9, plain, (animal(X1)|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_10, plain, (animal(X1)|~snail(X1))). % 0.18/0.40 cnf(i_0_19, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_23, plain, (plant(esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_25, plain, (plant(esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))). % 0.18/0.40 cnf(i_0_24, plain, (eats(X1,esk8_1(X1))|~snail(X1))). % 0.18/0.40 cnf(i_0_15, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_18, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))). % 0.18/0.40 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_14, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))). % 0.18/0.40 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))). % 0.18/0.40 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))). % 0.18/0.40 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))). % 0.18/0.40 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))). % 0.18/0.40 cnf(i_0_13, plain, (eats(X1,X2)|eats(X1,X3)|~much_smaller(X3,X1)|~eats(X3,X4)|~plant(X4)|~plant(X2)|~animal(X3)|~animal(X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 12 steps % 0.18/0.40 cnf(i_0_1, plain, (wolf(esk1_0)), inference(start_rule)). % 0.18/0.40 cnf(i_0_476, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_18])). % 0.18/0.40 cnf(i_0_3408, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_2])). % 0.18/0.40 cnf(i_0_3407, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_3418, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3407])). % 0.18/0.40 cnf(i_0_3419, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3419, ...])). % 0.18/0.40 cnf(i_0_3422, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3422, ...])). % 0.18/0.40 cnf(i_0_3423, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3423, ...])). % 0.18/0.40 cnf(i_0_3424, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3424, ...])). % 0.18/0.40 cnf(i_0_3420, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_22])). % 0.18/0.40 cnf(i_0_3421, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3421, ...])). % 0.18/0.40 cnf(i_0_3555, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3555, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # There were 6 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 6 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 6 successful branch saturations after the branch. % 0.18/0.40 # Child (29669) has found a proof. % 0.18/0.40 % 0.18/0.40 # Proof search is over... % 0.18/0.40 # Freeing feature tree %------------------------------------------------------------------------------