TSTP Solution File: SYO629-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO629-1 : TPTP v8.1.0. Released v7.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 : n009.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 16:05:49 EDT 2022
% Result : Unsatisfiable 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 9 08:04:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.35 #
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35 # Number of axioms: 12 Number of unprocessed: 8
% 0.11/0.35 # Tableaux proof search.
% 0.11/0.35 # APR header successfully linked.
% 0.11/0.35 # Hello from C++
% 0.11/0.35 # The folding up rule is enabled...
% 0.11/0.35 # Local unification is enabled...
% 0.11/0.35 # Any saturation attempts will use folding labels...
% 0.11/0.35 # 8 beginning clauses after preprocessing and clausification
% 0.11/0.35 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.11/0.35 # No conjectures.
% 0.11/0.35 # There are 8 start rule candidates:
% 0.11/0.35 # Found 4 unit axioms.
% 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.35 # 8 start rule tableaux created.
% 0.11/0.35 # 4 extension rule candidate clauses
% 0.11/0.35 # 4 unit axiom clauses
% 0.11/0.35
% 0.11/0.35 # Requested 8, 32 cores available to the main process.
% 0.11/0.35 # Closed tableau found in foldup close cycle with 6 folds and 3 closures done.
% 0.11/0.35 # There were 0 total branch saturation attempts.
% 0.11/0.35 # There were 0 of these attempts blocked.
% 0.11/0.35 # There were 0 deferred branch saturation attempts.
% 0.11/0.35 # There were 0 free duplicated saturations.
% 0.11/0.35 # There were 0 total successful branch saturations.
% 0.11/0.35 # There were 0 successful branch saturations in interreduction.
% 0.11/0.35 # There were 0 successful branch saturations on the branch.
% 0.11/0.35 # There were 0 successful branch saturations after the branch.
% 0.11/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # Begin clausification derivation
% 0.11/0.35
% 0.11/0.35 # End clausification derivation
% 0.11/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.35 cnf(i_0_14, plain, (iLEQ(X1,X1))).
% 0.11/0.35 cnf(i_0_21, plain, (iLEQ(X1,g(X1)))).
% 0.11/0.35 cnf(i_0_17, plain, (~'LE'(f(X1),'0'))).
% 0.11/0.35 cnf(i_0_13, plain, (~'E'(f(X1),f(g(X1))))).
% 0.11/0.35 cnf(i_0_16, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.11/0.35 cnf(i_0_15, plain, (~'E'('0',f(g(X1)))|~'E'('0',f(X1)))).
% 0.11/0.35 cnf(i_0_18, plain, ('E'('0',f(X1))|~'LE'(f(X2),s('0'))|~iLEQ(X2,X1))).
% 0.11/0.35 cnf(i_0_19, plain, (~'E'(s('0'),f(g(X1)))|~'E'(s('0'),f(X1)))).
% 0.11/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.35 # Begin printing tableau
% 0.11/0.35 # Found 14 steps
% 0.11/0.35 cnf(i_0_14, plain, (iLEQ(g(g(g(X6))),g(g(g(X6))))), inference(start_rule)).
% 0.11/0.35 cnf(i_0_25, plain, (iLEQ(g(g(g(X6))),g(g(g(X6))))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_42, plain, ('E'('0',f(g(g(g(X6)))))), inference(extension_rule, [i_0_15])).
% 0.11/0.35 cnf(i_0_48, plain, (~'E'('0',f(g(g(X6))))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_55, plain, (~iLEQ(g(g(X6)),g(g(X6)))), inference(closure_rule, [i_0_14])).
% 0.11/0.35 cnf(i_0_43, plain, (~'LE'(f(g(g(g(X6)))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_57, plain, ('E'(s('0'),f(g(g(g(X6)))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_54, plain, (~'LE'(f(g(g(X6))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_129, plain, ('E'(s('0'),f(g(g(X6))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_136, plain, (~'E'(s('0'),f(g(X6)))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_142, plain, ('LE'(f(g(X6)),s('0'))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_146, plain, ('E'('0',f(g(g(X6))))), inference(closure_rule, [i_0_48])).
% 0.11/0.35 cnf(i_0_148, plain, (~iLEQ(g(X6),g(g(X6)))), inference(closure_rule, [i_0_21])).
% 0.11/0.35 cnf(i_0_59, plain, (~'E'(s('0'),f(g(g(X6))))), inference(closure_rule, [i_0_57])).
% 0.11/0.35 # End printing tableau
% 0.11/0.35 # SZS output end
% 0.11/0.35 # Branches closed with saturation will be marked with an "s"
% 0.11/0.35 # Closed tableau found in foldup close cycle with 6 folds and 3 closures done.
% 0.11/0.35 # There were 0 total branch saturation attempts.
% 0.11/0.35 # There were 0 of these attempts blocked.
% 0.11/0.35 # There were 0 deferred branch saturation attempts.
% 0.11/0.35 # There were 0 free duplicated saturations.
% 0.11/0.35 # There were 0 total successful branch saturations.
% 0.11/0.35 # There were 0 successful branch saturations in interreduction.
% 0.11/0.35 # There were 0 successful branch saturations on the branch.
% 0.11/0.35 # There were 0 successful branch saturations after the branch.
% 0.11/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # Begin clausification derivation
% 0.11/0.35
% 0.11/0.35 # End clausification derivation
% 0.11/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.35 cnf(i_0_14, plain, (iLEQ(X1,X1))).
% 0.11/0.35 cnf(i_0_21, plain, (iLEQ(X1,g(X1)))).
% 0.11/0.35 cnf(i_0_17, plain, (~'LE'(f(X1),'0'))).
% 0.11/0.35 cnf(i_0_13, plain, (~'E'(f(X1),f(g(X1))))).
% 0.11/0.35 cnf(i_0_16, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.11/0.35 cnf(i_0_15, plain, (~'E'('0',f(g(X1)))|~'E'('0',f(X1)))).
% 0.11/0.35 cnf(i_0_18, plain, ('E'('0',f(X1))|~'LE'(f(X2),s('0'))|~iLEQ(X2,X1))).
% 0.11/0.35 cnf(i_0_19, plain, (~'E'(s('0'),f(g(X1)))|~'E'(s('0'),f(X1)))).
% 0.11/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.35 # Begin printing tableau
% 0.11/0.35 # Found 14 steps
% 0.11/0.35 cnf(i_0_21, plain, (iLEQ(g(g(X6)),g(g(g(X6))))), inference(start_rule)).
% 0.11/0.35 cnf(i_0_26, plain, (iLEQ(g(g(X6)),g(g(g(X6))))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_42, plain, ('E'('0',f(g(g(g(X6)))))), inference(extension_rule, [i_0_15])).
% 0.11/0.35 cnf(i_0_48, plain, (~'E'('0',f(g(g(X6))))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_55, plain, (~iLEQ(g(g(X6)),g(g(X6)))), inference(closure_rule, [i_0_14])).
% 0.11/0.35 cnf(i_0_43, plain, (~'LE'(f(g(g(X6))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_57, plain, ('E'(s('0'),f(g(g(X6))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_54, plain, (~'LE'(f(g(g(X6))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_129, plain, ('E'(s('0'),f(g(g(X6))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_136, plain, (~'E'(s('0'),f(g(X6)))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_142, plain, ('LE'(f(g(X6)),s('0'))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_146, plain, ('E'('0',f(g(g(X6))))), inference(closure_rule, [i_0_48])).
% 0.11/0.35 cnf(i_0_148, plain, (~iLEQ(g(X6),g(g(X6)))), inference(closure_rule, [i_0_21])).
% 0.11/0.35 cnf(i_0_59, plain, (~'E'(s('0'),f(g(X6)))), inference(closure_rule, [i_0_57])).
% 0.11/0.35 # End printing tableau
% 0.11/0.35 # SZS output end
% 0.11/0.35 # Branches closed with saturation will be marked with an "s"
% 0.11/0.35 # Closed tableau found in foldup close cycle with 6 folds and 3 closures done.
% 0.11/0.35 # There were 0 total branch saturation attempts.
% 0.11/0.35 # There were 0 of these attempts blocked.
% 0.11/0.35 # There were 0 deferred branch saturation attempts.
% 0.11/0.35 # There were 0 free duplicated saturations.
% 0.11/0.35 # There were 0 total successful branch saturations.
% 0.11/0.35 # There were 0 successful branch saturations in interreduction.
% 0.11/0.35 # There were 0 successful branch saturations on the branch.
% 0.11/0.35 # There were 0 successful branch saturations after the branch.
% 0.11/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 # Begin clausification derivation
% 0.11/0.35
% 0.11/0.35 # End clausification derivation
% 0.11/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.35 cnf(i_0_14, plain, (iLEQ(X1,X1))).
% 0.11/0.35 cnf(i_0_21, plain, (iLEQ(X1,g(X1)))).
% 0.11/0.35 cnf(i_0_17, plain, (~'LE'(f(X1),'0'))).
% 0.11/0.35 cnf(i_0_13, plain, (~'E'(f(X1),f(g(X1))))).
% 0.11/0.35 cnf(i_0_16, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.11/0.35 cnf(i_0_15, plain, (~'E'('0',f(g(X1)))|~'E'('0',f(X1)))).
% 0.11/0.35 cnf(i_0_18, plain, ('E'('0',f(X1))|~'LE'(f(X2),s('0'))|~iLEQ(X2,X1))).
% 0.11/0.35 cnf(i_0_19, plain, (~'E'(s('0'),f(g(X1)))|~'E'(s('0'),f(X1)))).
% 0.11/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.35 # Begin printing tableau
% 0.11/0.35 # Found 15 steps
% 0.11/0.35 cnf(i_0_18, plain, ('E'('0',f(g(g(g(X8)))))|~'LE'(f(g(g(g(X8)))),s('0'))|~iLEQ(g(g(g(X8))),g(g(g(X8))))), inference(start_rule)).
% 0.11/0.35 cnf(i_0_35, plain, (~iLEQ(g(g(g(X8))),g(g(g(X8))))), inference(closure_rule, [i_0_14])).
% 0.11/0.35 cnf(i_0_33, plain, ('E'('0',f(g(g(g(X8)))))), inference(extension_rule, [i_0_15])).
% 0.11/0.35 cnf(i_0_41, plain, (~'E'('0',f(g(g(X8))))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_46, plain, (~iLEQ(g(g(X8)),g(g(X8)))), inference(closure_rule, [i_0_14])).
% 0.11/0.35 cnf(i_0_45, plain, (~'LE'(f(g(g(X8))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_34, plain, (~'LE'(f(g(g(g(X8)))),s('0'))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_57, plain, ('E'(s('0'),f(g(g(g(X8)))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_59, plain, (~'E'(s('0'),f(g(g(X8))))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_48, plain, ('E'(s('0'),f(g(g(X8))))), inference(extension_rule, [i_0_19])).
% 0.11/0.35 cnf(i_0_159, plain, (~'E'(s('0'),f(g(X8)))), inference(extension_rule, [i_0_16])).
% 0.11/0.35 cnf(i_0_165, plain, ('LE'(f(g(X8)),s('0'))), inference(extension_rule, [i_0_18])).
% 0.11/0.35 cnf(i_0_169, plain, ('E'('0',f(g(g(X8))))), inference(closure_rule, [i_0_41])).
% 0.11/0.35 cnf(i_0_171, plain, (~iLEQ(g(X8),g(g(X8)))), inference(closure_rule, [i_0_21])).
% 0.11/0.35 cnf(i_0_65, plain, ('LE'(f(g(g(X8))),s('0'))), inference(closure_rule, [i_0_34])).
% 0.11/0.35 # End printing tableau
% 0.11/0.35 # SZS output end
% 0.11/0.35 # Branches closed with saturation will be marked with an "s"
% 0.11/0.35 # Child (9892) has found a proof.
% 0.11/0.35
% 0.11/0.35 # Proof search is over...
% 0.11/0.35 # Freeing feature tree
%------------------------------------------------------------------------------