TSTP Solution File: PUZ031+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.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 : n032.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.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PUZ031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sat May 28 23:08:26 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.31 # No SInE strategy applied
% 0.14/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.31 #
% 0.14/0.31 # Presaturation interreduction done
% 0.14/0.31 # Number of axioms: 26 Number of unprocessed: 26
% 0.14/0.31 # Tableaux proof search.
% 0.14/0.31 # APR header successfully linked.
% 0.14/0.31 # Hello from C++
% 0.14/0.31 # The folding up rule is enabled...
% 0.14/0.31 # Local unification is enabled...
% 0.14/0.31 # Any saturation attempts will use folding labels...
% 0.14/0.31 # 26 beginning clauses after preprocessing and clausification
% 0.14/0.31 # Creating start rules for all 1 conjectures.
% 0.14/0.31 # There are 1 start rule candidates:
% 0.14/0.31 # Found 6 unit axioms.
% 0.14/0.31 # 1 start rule tableaux created.
% 0.14/0.31 # 20 extension rule candidate clauses
% 0.14/0.31 # 6 unit axiom clauses
% 0.14/0.31
% 0.14/0.31 # Requested 8, 32 cores available to the main process.
% 0.14/0.31 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.31 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.31 # We now have 9 tableaux to operate on
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.33 # There were 6 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 6 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 6 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_11, plain, (grain(esk6_0))).
% 0.14/0.33 cnf(i_0_2, plain, (wolf(esk1_0))).
% 0.14/0.33 cnf(i_0_4, plain, (fox(esk2_0))).
% 0.14/0.33 cnf(i_0_6, plain, (bird(esk3_0))).
% 0.14/0.33 cnf(i_0_8, plain, (caterpillar(esk4_0))).
% 0.14/0.33 cnf(i_0_10, plain, (snail(esk5_0))).
% 0.14/0.33 cnf(i_0_12, plain, (plant(X1)|~grain(X1))).
% 0.14/0.33 cnf(i_0_1, plain, (animal(X1)|~wolf(X1))).
% 0.14/0.33 cnf(i_0_3, plain, (animal(X1)|~fox(X1))).
% 0.14/0.33 cnf(i_0_5, plain, (animal(X1)|~bird(X1))).
% 0.14/0.33 cnf(i_0_7, plain, (animal(X1)|~caterpillar(X1))).
% 0.14/0.33 cnf(i_0_9, plain, (animal(X1)|~snail(X1))).
% 0.14/0.33 cnf(i_0_18, plain, (~eats(X1,X2)|~grain(X2)|~wolf(X1))).
% 0.14/0.33 cnf(i_0_25, plain, (plant(esk7_1(X1))|~caterpillar(X1))).
% 0.14/0.33 cnf(i_0_23, plain, (plant(esk7_1(X1))|~snail(X1))).
% 0.14/0.33 cnf(i_0_24, plain, (eats(X1,esk7_1(X1))|~caterpillar(X1))).
% 0.14/0.33 cnf(i_0_22, plain, (eats(X1,esk7_1(X1))|~snail(X1))).
% 0.14/0.33 cnf(i_0_17, plain, (much_smaller(X1,X2)|~fox(X1)|~wolf(X2))).
% 0.14/0.33 cnf(i_0_19, plain, (~eats(X1,X2)|~fox(X2)|~wolf(X1))).
% 0.14/0.33 cnf(i_0_21, plain, (~eats(X1,X2)|~snail(X2)|~bird(X1))).
% 0.14/0.33 cnf(i_0_16, plain, (much_smaller(X1,X2)|~bird(X1)|~fox(X2))).
% 0.14/0.33 cnf(i_0_14, plain, (much_smaller(X1,X2)|~caterpillar(X1)|~bird(X2))).
% 0.14/0.33 cnf(i_0_15, plain, (much_smaller(X1,X2)|~snail(X1)|~bird(X2))).
% 0.14/0.33 cnf(i_0_20, plain, (eats(X1,X2)|~caterpillar(X2)|~bird(X1))).
% 0.14/0.33 cnf(i_0_26, negated_conjecture, (~eats(X1,X2)|~eats(X3,X1)|~grain(X2)|~animal(X1)|~animal(X3))).
% 0.14/0.33 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.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 12 steps
% 0.14/0.33 cnf(i_0_2, plain, (wolf(esk1_0)), inference(start_rule)).
% 0.14/0.33 cnf(i_0_590, plain, (wolf(esk1_0)), inference(extension_rule, [i_0_19])).
% 0.14/0.33 cnf(i_0_3522, plain, (~fox(esk2_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.33 cnf(i_0_3521, plain, (~eats(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])).
% 0.14/0.33 cnf(i_0_3532, plain, (eats(esk1_0,esk2_0)), inference(closure_rule, [i_0_3521])).
% 0.14/0.33 cnf(i_0_3533, plain, (~much_smaller(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_3533, ...])).
% 0.14/0.33 cnf(i_0_3536, plain, (~plant(esk2_0)), inference(etableau_closure_rule, [i_0_3536, ...])).
% 0.14/0.33 cnf(i_0_3537, plain, (~animal(esk2_0)), inference(etableau_closure_rule, [i_0_3537, ...])).
% 0.14/0.33 cnf(i_0_3538, plain, (~animal(esk1_0)), inference(etableau_closure_rule, [i_0_3538, ...])).
% 0.14/0.33 cnf(i_0_3534, plain, (~eats(esk2_0,esk7_1(esk2_0))), inference(extension_rule, [i_0_24])).
% 0.14/0.33 cnf(i_0_3535, plain, (~plant(esk7_1(esk2_0))), inference(etableau_closure_rule, [i_0_3535, ...])).
% 0.14/0.33 cnf(i_0_3685, plain, (~caterpillar(esk2_0)), inference(etableau_closure_rule, [i_0_3685, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # Child (2580) has found a proof.
% 0.14/0.33
% 0.14/0.33 # Proof search is over...
% 0.14/0.33 # Freeing feature tree
%------------------------------------------------------------------------------