TSTP Solution File: SYN939+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN939+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 : n029.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 : Thu Jul 21 06:14:58 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN939+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 06:09:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 5 Number of unprocessed: 5
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 5 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 1 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 4 extension rule candidate clauses
% 0.13/0.37 # 1 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5
% 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 13 tableaux to operate on
% 0.13/0.37 # Closed tableau found in foldup close cycle with 2 folds and 3 closures done.
% 0.13/0.37 # There were 0 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 0 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 0 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_5, negated_conjecture, (q(f(X1)))).
% 0.13/0.37 cnf(i_0_1, negated_conjecture, (~r(esk1_0)|~r(esk2_0)|~p(X1)|~q(X1))).
% 0.13/0.37 cnf(i_0_3, negated_conjecture, (p(f(X1))|~r(esk1_0)|~r(esk2_0)|~q(X2))).
% 0.13/0.37 cnf(i_0_2, negated_conjecture, (r(X1)|~p(X2)|~q(X2))).
% 0.13/0.37 cnf(i_0_4, negated_conjecture, (r(X1)|p(f(X1))|~q(X2))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 18 steps
% 0.13/0.37 cnf(i_0_1, negated_conjecture, (~r(esk1_0)|~r(esk2_0)|~p(f(esk1_0))|~q(f(esk1_0))), inference(start_rule)).
% 0.13/0.37 cnf(i_0_19, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_16, plain, (~r(esk1_0)), inference(extension_rule, [i_0_4])).
% 0.13/0.37 cnf(i_0_65, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_64, plain, (p(f(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.13/0.37 cnf(i_0_66, plain, (r(esk1_0)), inference(closure_rule, [i_0_16])).
% 0.13/0.37 cnf(i_0_68, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_17, plain, (~r(esk2_0)), inference(extension_rule, [i_0_4])).
% 0.13/0.37 cnf(i_0_79, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_78, plain, (p(f(esk2_0))), inference(extension_rule, [i_0_2])).
% 0.13/0.37 cnf(i_0_88, plain, (r(esk2_0)), inference(closure_rule, [i_0_17])).
% 0.13/0.37 cnf(i_0_90, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_18, plain, (~p(f(esk1_0))), inference(extension_rule, [i_0_4])).
% 0.13/0.37 cnf(i_0_101, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 cnf(i_0_99, plain, (r(esk1_0)), inference(extension_rule, [i_0_3])).
% 0.13/0.37 cnf(i_0_102, plain, (p(f(esk1_0))), inference(closure_rule, [i_0_18])).
% 0.13/0.37 cnf(i_0_104, plain, (~r(esk2_0)), inference(closure_rule, [i_0_17])).
% 0.13/0.37 cnf(i_0_105, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Closed tableau found in foldup close cycle with 4 folds and 2 closures done.
% 0.13/0.37 # There were 0 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 0 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # Closed tableau found in foldup close cycle with 4 folds and 2 closures done.
% 0.19/0.37 # There were 0 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_5, negated_conjecture, (q(f(X1)))).
% 0.19/0.37 cnf(i_0_1, negated_conjecture, (~r(esk1_0)|~r(esk2_0)|~p(X1)|~q(X1))).
% 0.19/0.37 cnf(i_0_3, negated_conjecture, (p(f(X1))|~r(esk1_0)|~r(esk2_0)|~q(X2))).
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(X1)|~p(X2)|~q(X2))).
% 0.19/0.37 cnf(i_0_4, negated_conjecture, (r(X1)|p(f(X1))|~q(X2))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 18 steps
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(esk1_0)|~p(f(esk1_0))|~q(f(esk1_0))), inference(start_rule)).
% 0.19/0.37 cnf(i_0_11, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_9, plain, (r(esk1_0)), inference(extension_rule, [i_0_1])).
% 0.19/0.37 cnf(i_0_62, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_60, plain, (~r(esk2_0)), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_65, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_64, plain, (p(f(esk2_0))), inference(extension_rule, [i_0_2])).
% 0.19/0.37 cnf(i_0_66, plain, (r(esk2_0)), inference(closure_rule, [i_0_60])).
% 0.19/0.37 cnf(i_0_68, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_61, plain, (~p(f(esk1_0))), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_79, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_77, plain, (r(esk1_0)), inference(extension_rule, [i_0_3])).
% 0.19/0.37 cnf(i_0_80, plain, (p(f(esk1_0))), inference(closure_rule, [i_0_61])).
% 0.19/0.37 cnf(i_0_82, plain, (~r(esk2_0)), inference(closure_rule, [i_0_60])).
% 0.19/0.37 cnf(i_0_83, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_10, plain, (~p(f(esk1_0))), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_91, plain, (r(esk1_0)), inference(closure_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_93, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_5, negated_conjecture, (q(f(X1)))).
% 0.19/0.37 cnf(i_0_1, negated_conjecture, (~r(esk1_0)|~r(esk2_0)|~p(X1)|~q(X1))).
% 0.19/0.37 cnf(i_0_3, negated_conjecture, (p(f(X1))|~r(esk1_0)|~r(esk2_0)|~q(X2))).
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(X1)|~p(X2)|~q(X2))).
% 0.19/0.37 cnf(i_0_4, negated_conjecture, (r(X1)|p(f(X1))|~q(X2))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 18 steps
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(esk2_0)|~p(f(esk2_0))|~q(f(esk2_0))), inference(start_rule)).
% 0.19/0.37 cnf(i_0_11, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_9, plain, (r(esk2_0)), inference(extension_rule, [i_0_1])).
% 0.19/0.37 cnf(i_0_62, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_59, plain, (~r(esk1_0)), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_65, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_64, plain, (p(f(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.19/0.37 cnf(i_0_66, plain, (r(esk1_0)), inference(closure_rule, [i_0_59])).
% 0.19/0.37 cnf(i_0_68, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_61, plain, (~p(f(esk1_0))), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_79, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_77, plain, (r(esk1_0)), inference(extension_rule, [i_0_3])).
% 0.19/0.37 cnf(i_0_80, plain, (p(f(esk1_0))), inference(closure_rule, [i_0_61])).
% 0.19/0.37 cnf(i_0_82, plain, (~r(esk2_0)), inference(closure_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_83, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_10, plain, (~p(f(esk2_0))), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_91, plain, (r(esk2_0)), inference(closure_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_93, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Closed tableau found in foldup close cycle with 3 folds and 2 closures done.
% 0.19/0.37 # There were 0 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_5, negated_conjecture, (q(f(X1)))).
% 0.19/0.37 cnf(i_0_1, negated_conjecture, (~r(esk1_0)|~r(esk2_0)|~p(X1)|~q(X1))).
% 0.19/0.37 cnf(i_0_3, negated_conjecture, (p(f(X1))|~r(esk1_0)|~r(esk2_0)|~q(X2))).
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(X1)|~p(X2)|~q(X2))).
% 0.19/0.37 cnf(i_0_4, negated_conjecture, (r(X1)|p(f(X1))|~q(X2))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 16 steps
% 0.19/0.37 cnf(i_0_2, negated_conjecture, (r(esk2_0)|~p(f(esk2_0))|~q(f(esk2_0))), inference(start_rule)).
% 0.19/0.37 cnf(i_0_11, plain, (~q(f(esk2_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_9, plain, (r(esk2_0)), inference(extension_rule, [i_0_3])).
% 0.19/0.37 cnf(i_0_58, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_55, plain, (p(f(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.19/0.37 cnf(i_0_68, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_66, plain, (r(esk1_0)), inference(extension_rule, [i_0_1])).
% 0.19/0.37 cnf(i_0_77, plain, (~r(esk2_0)), inference(closure_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_78, plain, (~p(f(esk1_0))), inference(closure_rule, [i_0_55])).
% 0.19/0.37 cnf(i_0_79, plain, (~q(f(esk1_0))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_56, plain, (~r(esk1_0)), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_81, plain, (p(f(esk1_0))), inference(closure_rule, [i_0_55])).
% 0.19/0.37 cnf(i_0_82, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 cnf(i_0_10, plain, (~p(f(esk2_0))), inference(extension_rule, [i_0_4])).
% 0.19/0.37 cnf(i_0_94, plain, (r(esk2_0)), inference(closure_rule, [i_0_9])).
% 0.19/0.37 cnf(i_0_96, plain, (~q(f(X1))), inference(closure_rule, [i_0_5])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Child (14503) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------