TSTP Solution File: SYO666-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO666-1 : TPTP v8.1.0. Released v7.3.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 16:06:03 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO666-1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 13:01:30 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 10 Number of unprocessed: 10
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 10 beginning clauses after preprocessing and clausification
% 0.13/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.13/0.36 # No conjectures.
% 0.13/0.36 # There are 10 start rule candidates:
% 0.13/0.36 # Found 2 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 10 start rule tableaux created.
% 0.13/0.36 # 8 extension rule candidate clauses
% 0.13/0.36 # 2 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There were 14 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 10 free duplicated saturations.
% 0.19/0.39 # There were 14 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 4 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_16, plain, ('LE'(f(X1),s(s('0'))))).
% 0.19/0.39 cnf(i_0_13, plain, (~'LE'(f(z),'0'))).
% 0.19/0.39 cnf(i_0_15, plain, ('LE'(f(X1),'0')|'E'('0',f(X1))|~'LE'(f(X1),s('0')))).
% 0.19/0.39 cnf(i_0_12, plain, (iLEQ(suc(X1),suc(X1))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.19/0.39 cnf(i_0_14, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(X1)))|~'LE'(f(suc(X1)),s('0')))).
% 0.19/0.39 cnf(i_0_19, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.19/0.39 cnf(i_0_18, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(X1))))).
% 0.19/0.39 cnf(i_0_17, plain, (iLEQ(suc(X1),suc(X1))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.19/0.39 cnf(i_0_11, plain, (~'E'('0',f(suc(X1)))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X3)))|~'E'('0',f(suc(X4)))|~'E'('0',f(suc(X5)))|~'E'('0',f(suc(X6)))|~'E'('0',f(X1))|~'E'('0',f(X2))|~'E'('0',f(X3))|~'E'('0',f(X4))|~'E'('0',f(X5))|~'E'('0',f(X6))|~iLEQ(suc(X1),suc(X6))|~iLEQ(suc(X2),suc(X1))|~iLEQ(suc(X4),suc(X2))|~iLEQ(suc(X5),suc(X3))|~iLEQ(suc(X6),suc(X5)))).
% 0.19/0.39 cnf(i_0_20, plain, (~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X3)))|~'E'(s('0'),f(suc(X4)))|~'E'(s('0'),f(suc(X5)))|~'E'(s('0'),f(suc(X6)))|~'E'(s('0'),f(X1))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X3))|~'E'(s('0'),f(X4))|~'E'(s('0'),f(X5))|~'E'(s('0'),f(X6))|~iLEQ(suc(X2),suc(X5))|~iLEQ(suc(X3),suc(X6))|~iLEQ(suc(X4),suc(X1))|~iLEQ(suc(X5),suc(X4))|~iLEQ(suc(X6),suc(X2)))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 22 steps
% 0.19/0.39 cnf(i_0_14, plain, ('LE'(f(z),'0')|'E'('0',f(suc(z)))|~'LE'(f(suc(z)),s('0'))), inference(start_rule)).
% 0.19/0.39 cnf(i_0_29, plain, ('LE'(f(z),'0')), inference(closure_rule, [i_0_13])).
% 0.19/0.39 cnf(i_0_30, plain, ('E'('0',f(suc(z)))), inference(extension_rule, [i_0_12])).
% 0.19/0.39 cnf(i_0_76, plain, (iLEQ(suc(z),suc(z))), inference(extension_rule, [i_0_20])).
% 0.19/0.39 cnf(i_0_122, plain, (~iLEQ(suc(z),suc(z))), inference(closure_rule, [i_0_76])).
% 0.19/0.39 cnf(i_0_123, plain, (~iLEQ(suc(z),suc(z))), inference(closure_rule, [i_0_76])).
% 0.19/0.39 cnf(i_0_124, plain, (~iLEQ(suc(z),suc(z))), inference(closure_rule, [i_0_76])).
% 0.19/0.39 cnf(i_0_125, plain, (~iLEQ(suc(z),suc(z))), inference(closure_rule, [i_0_76])).
% 0.19/0.39 cnf(i_0_31, plain, (~'LE'(f(suc(z)),s('0'))), inference(etableau_closure_rule, [i_0_31, ...])).
% 0.19/0.39 cnf(i_0_78, plain, (~'E'('0',f(z))), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.19/0.39 cnf(i_0_109, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_109, ...])).
% 0.19/0.39 cnf(i_0_110, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_110, ...])).
% 0.19/0.39 cnf(i_0_111, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_111, ...])).
% 0.19/0.39 cnf(i_0_112, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_112, ...])).
% 0.19/0.39 cnf(i_0_113, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_113, ...])).
% 0.19/0.39 cnf(i_0_114, plain, (~'E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.19/0.39 cnf(i_0_115, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_115, ...])).
% 0.19/0.39 cnf(i_0_116, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_116, ...])).
% 0.19/0.39 cnf(i_0_117, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_117, ...])).
% 0.19/0.39 cnf(i_0_118, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.19/0.39 cnf(i_0_119, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.19/0.39 cnf(i_0_120, plain, (~'E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_120, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (20153) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------