TSTP Solution File: SYO634-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO634-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 : n010.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:51 EDT 2022
% Result : Unsatisfiable 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO634-1 : TPTP v8.1.0. Released v7.1.0.
% 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 9 06:44:46 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 # No SInE strategy applied
% 0.11/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.34 #
% 0.11/0.34 # Presaturation interreduction done
% 0.11/0.34 # Number of axioms: 23 Number of unprocessed: 21
% 0.11/0.34 # Tableaux proof search.
% 0.11/0.34 # APR header successfully linked.
% 0.11/0.34 # Hello from C++
% 0.11/0.34 # The folding up rule is enabled...
% 0.11/0.34 # Local unification is enabled...
% 0.11/0.34 # Any saturation attempts will use folding labels...
% 0.11/0.34 # 21 beginning clauses after preprocessing and clausification
% 0.11/0.34 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.11/0.34 # No conjectures.
% 0.11/0.34 # There are 21 start rule candidates:
% 0.11/0.34 # Found 14 unit axioms.
% 0.11/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.34 # 21 start rule tableaux created.
% 0.11/0.34 # 7 extension rule candidate clauses
% 0.11/0.34 # 14 unit axiom clauses
% 0.11/0.34
% 0.11/0.34 # Requested 8, 32 cores available to the main process.
% 0.11/0.34 # Closed tableau found in foldup close cycle with 3 folds and 1 closures done.
% 0.11/0.34 # There were 0 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 0 total successful branch saturations.
% 0.11/0.34 # There were 0 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 0 successful branch saturations after the branch.
% 0.11/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_32, plain, ('E'(f(X1),s(s(s(s(s(s(s(s(s('0')))))))))))).
% 0.11/0.34 cnf(i_0_26, plain, ('E'(f(X1),s(s(s(s(s(s(s(s(s(s('0'))))))))))))).
% 0.11/0.34 cnf(i_0_36, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s(s('0'))))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_46, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s(s(s('0')))))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_24, plain, ('E'(f(X1),s(s(s(s(s(s(s(s('0'))))))))))).
% 0.11/0.34 cnf(i_0_28, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s('0')))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_37, plain, ('E'(f(X1),s(s(s(s(s(s(s('0')))))))))).
% 0.11/0.34 cnf(i_0_41, plain, ('LEQ'('AP'(s(s(s(s(s(s(s('0'))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_29, plain, ('E'(f(X1),s(s(s(s(s(s('0'))))))))).
% 0.11/0.34 cnf(i_0_39, plain, ('LEQ'('AP'(s(s(s(s(s(s('0')))))),X1),X2))).
% 0.11/0.34 cnf(i_0_43, plain, ('E'(f(X1),s(s(s(s(s('0')))))))).
% 0.11/0.34 cnf(i_0_44, plain, ('LEQ'('AP'(s(s(s(s(s('0'))))),X1),X2))).
% 0.11/0.34 cnf(i_0_35, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_31, plain, ('LEQ'('AP'(s(s(s(s('0')))),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)))).
% 0.11/0.34 cnf(i_0_38, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s(s('0'))))|~'E'(f(X2),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_30, plain, ('LEQ'('AP'(s(s(s('0'))),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_42, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s('0')))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0')))))).
% 0.11/0.34 cnf(i_0_27, plain, ('LEQ'('AP'(s(s('0')),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0')))))).
% 0.11/0.34 cnf(i_0_34, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s('0'))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0'))))|~'E'(f(X4),s(s('0'))))).
% 0.11/0.34 cnf(i_0_33, plain, ('LEQ'('AP'(s('0'),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0'))))|~'E'(f(X4),s(s('0'))))).
% 0.11/0.34 cnf(i_0_45, plain, (~'E'(f(X1),s(s(s(s('0')))))|~'E'(f(X2),s(s(s('0'))))|~'E'(f(X3),s(s('0')))|~'E'(f(X4),s('0')))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 13 steps
% 0.11/0.34 cnf(i_0_42, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s('0')))|~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X4)),s(s(s(s('0')))))|~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s('0'))))), inference(start_rule)).
% 0.11/0.34 cnf(i_0_66, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X4)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_65, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s('0')))), inference(extension_rule, [i_0_34])).
% 0.11/0.34 cnf(i_0_138, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_137, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X14)),s('0'))), inference(extension_rule, [i_0_45])).
% 0.11/0.34 cnf(i_0_155, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_157, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s('0')))), inference(closure_rule, [i_0_65])).
% 0.11/0.34 cnf(i_0_156, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s('0'))))), inference(extension_rule, [i_0_38])).
% 0.11/0.34 cnf(i_0_160, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_139, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s('0'))))), inference(extension_rule, [i_0_38])).
% 0.11/0.34 cnf(i_0_182, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_67, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s('0'))))), inference(extension_rule, [i_0_38])).
% 0.11/0.34 cnf(i_0_204, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # Closed tableau found in foldup close cycle with 2 folds and 2 closures done.
% 0.11/0.34 # There were 0 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 0 total successful branch saturations.
% 0.11/0.34 # There were 0 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 0 successful branch saturations after the branch.
% 0.11/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_32, plain, ('E'(f(X1),s(s(s(s(s(s(s(s(s('0')))))))))))).
% 0.11/0.34 cnf(i_0_26, plain, ('E'(f(X1),s(s(s(s(s(s(s(s(s(s('0'))))))))))))).
% 0.11/0.34 cnf(i_0_36, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s(s('0'))))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_46, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s(s(s('0')))))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_24, plain, ('E'(f(X1),s(s(s(s(s(s(s(s('0'))))))))))).
% 0.11/0.34 cnf(i_0_28, plain, ('LEQ'('AP'(s(s(s(s(s(s(s(s('0')))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_37, plain, ('E'(f(X1),s(s(s(s(s(s(s('0')))))))))).
% 0.11/0.34 cnf(i_0_41, plain, ('LEQ'('AP'(s(s(s(s(s(s(s('0'))))))),X1),X2))).
% 0.11/0.34 cnf(i_0_29, plain, ('E'(f(X1),s(s(s(s(s(s('0'))))))))).
% 0.11/0.34 cnf(i_0_39, plain, ('LEQ'('AP'(s(s(s(s(s(s('0')))))),X1),X2))).
% 0.11/0.34 cnf(i_0_43, plain, ('E'(f(X1),s(s(s(s(s('0')))))))).
% 0.11/0.34 cnf(i_0_44, plain, ('LEQ'('AP'(s(s(s(s(s('0'))))),X1),X2))).
% 0.11/0.34 cnf(i_0_35, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_31, plain, ('LEQ'('AP'(s(s(s(s('0')))),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)))).
% 0.11/0.34 cnf(i_0_38, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s(s('0'))))|~'E'(f(X2),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_30, plain, ('LEQ'('AP'(s(s(s('0'))),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0'))))))).
% 0.11/0.34 cnf(i_0_42, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s(s('0')))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0')))))).
% 0.11/0.34 cnf(i_0_27, plain, ('LEQ'('AP'(s(s('0')),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0')))))).
% 0.11/0.34 cnf(i_0_34, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s('0'))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0'))))|~'E'(f(X4),s(s('0'))))).
% 0.11/0.34 cnf(i_0_33, plain, ('LEQ'('AP'(s('0'),X1),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1))|~'E'(f(X2),s(s(s(s('0')))))|~'E'(f(X3),s(s(s('0'))))|~'E'(f(X4),s(s('0'))))).
% 0.11/0.34 cnf(i_0_45, plain, (~'E'(f(X1),s(s(s(s('0')))))|~'E'(f(X2),s(s(s('0'))))|~'E'(f(X3),s(s('0')))|~'E'(f(X4),s('0')))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 14 steps
% 0.11/0.34 cnf(i_0_34, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s('0'))|~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s(s('0')))))|~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X26)),s(s(s('0'))))|~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X7)),s(s('0')))), inference(start_rule)).
% 0.11/0.34 cnf(i_0_72, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X5)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_71, plain, ('E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X1)),s('0'))), inference(extension_rule, [i_0_45])).
% 0.11/0.34 cnf(i_0_145, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_146, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X29)),s(s(s('0'))))), inference(extension_rule, [i_0_38])).
% 0.11/0.34 cnf(i_0_150, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_147, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),'AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2))),s(s('0')))), inference(extension_rule, [i_0_42])).
% 0.11/0.34 cnf(i_0_154, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_155, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X29)),s(s(s('0'))))), inference(closure_rule, [i_0_146])).
% 0.11/0.34 cnf(i_0_73, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X26)),s(s(s('0'))))), inference(extension_rule, [i_0_38])).
% 0.11/0.34 cnf(i_0_174, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_74, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X7)),s(s('0')))), inference(extension_rule, [i_0_42])).
% 0.11/0.34 cnf(i_0_193, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X2)),s(s(s(s('0')))))), inference(closure_rule, [i_0_35])).
% 0.11/0.34 cnf(i_0_194, plain, (~'E'(f('AP'(s(s(s(s(s(s(s(s(s(s(s('0'))))))))))),X26)),s(s(s('0'))))), inference(closure_rule, [i_0_73])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # Child (30954) has found a proof.
% 0.11/0.34
% 0.11/0.34 # Proof search is over...
% 0.11/0.34 # Freeing feature tree
%------------------------------------------------------------------------------