TSTP Solution File: SYO675-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO675-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 : n020.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:06 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.03/0.12 % Problem : SYO675-1 : TPTP v8.1.0. Released v7.3.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.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 08:34:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 30 Number of unprocessed: 30
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 30 beginning clauses after preprocessing and clausification
% 0.19/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.19/0.37 # No conjectures.
% 0.19/0.37 # There are 30 start rule candidates:
% 0.19/0.37 # Found 2 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 30 start rule tableaux created.
% 0.19/0.37 # 28 extension rule candidate clauses
% 0.19/0.37 # 2 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There were 3 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 0 free duplicated saturations.
% 0.19/0.39 # There were 3 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 3 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_60, plain, ('LE'(f(X1),s(s(s(s('0'))))))).
% 0.19/0.39 cnf(i_0_48, plain, (~'LE'(f(z),'0'))).
% 0.19/0.39 cnf(i_0_53, plain, ('LE'(f(X1),'0')|'E'('0',f(X1))|~'LE'(f(X1),s('0')))).
% 0.19/0.39 cnf(i_0_39, plain, ('E'(f(X1),f(suc(X1)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.19/0.39 cnf(i_0_36, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(X1)))|~'LE'(f(suc(X1)),s('0')))).
% 0.19/0.39 cnf(i_0_56, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1))|~'LE'(f(X1),s(s('0'))))).
% 0.19/0.39 cnf(i_0_46, plain, ('E'(f(X1),f(suc(X1)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.19/0.39 cnf(i_0_37, plain, ('E'(f(X1),f(suc(X1)))|~'E'(s(s('0')),f(suc(X1)))|~'E'(s(s('0')),f(X1)))).
% 0.19/0.39 cnf(i_0_45, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(suc(X1))))|~'LE'(f(suc(suc(X1))),s('0')))).
% 0.19/0.39 cnf(i_0_40, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(X1)))|~'LE'(f(suc(X1)),s(s('0'))))).
% 0.19/0.39 cnf(i_0_33, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(suc(suc(X1)))))|~'LE'(f(suc(suc(suc(X1)))),s('0')))).
% 0.19/0.39 cnf(i_0_38, plain, ('LE'(f(X1),s(s('0')))|'E'(s(s('0')),f(X1))|~'LE'(f(X1),s(s(s('0')))))).
% 0.19/0.39 cnf(i_0_32, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(suc(X1))))|~'LE'(f(suc(suc(X1))),s(s('0'))))).
% 0.19/0.39 cnf(i_0_42, plain, ('LE'(f(X1),s(s('0')))|'E'(s(s('0')),f(suc(X1)))|~'LE'(f(suc(X1)),s(s(s('0')))))).
% 0.19/0.39 cnf(i_0_44, plain, ('E'(f(X1),f(suc(X1)))|~'E'(s(s(s('0'))),f(suc(X1)))|~'E'(s(s(s('0'))),f(X1)))).
% 0.19/0.39 cnf(i_0_50, plain, ('LE'(f(X1),s(s(s('0'))))|'E'(s(s(s('0'))),f(X1)))).
% 0.19/0.39 cnf(i_0_41, plain, ('LE'(f(X1),s(s('0')))|'E'(s(s('0')),f(suc(suc(X1))))|~'LE'(f(suc(suc(X1))),s(s(s('0')))))).
% 0.19/0.39 cnf(i_0_51, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(suc(suc(X1)))))|~'LE'(f(suc(suc(suc(X1)))),s(s('0'))))).
% 0.19/0.39 cnf(i_0_57, plain, ('E'(f(X1),f(suc(suc(X1))))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.19/0.39 cnf(i_0_31, plain, (~'E'('0',f(suc(suc(suc(X1)))))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.19/0.39 cnf(i_0_59, plain, ('E'(f(X1),f(suc(suc(X1))))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.19/0.39 cnf(i_0_55, plain, ('LE'(f(X1),s(s(s('0'))))|'E'(s(s(s('0'))),f(suc(X1))))).
% 0.19/0.39 cnf(i_0_35, plain, ('LE'(f(X1),s(s('0')))|'E'(s(s('0')),f(suc(suc(suc(X1)))))|~'LE'(f(suc(suc(suc(X1)))),s(s(s('0')))))).
% 0.19/0.39 cnf(i_0_49, plain, ('LE'(f(X1),s(s(s('0'))))|'E'(s(s(s('0'))),f(suc(suc(X1)))))).
% 0.19/0.39 cnf(i_0_58, plain, ('LE'(f(X1),s(s(s('0'))))|'E'(s(s(s('0'))),f(suc(suc(suc(X1))))))).
% 0.19/0.39 cnf(i_0_43, plain, ('E'(f(X1),f(suc(suc(X1))))|~'E'(s(s('0')),f(suc(suc(X1))))|~'E'(s(s('0')),f(suc(X1)))|~'E'(s(s('0')),f(X1)))).
% 0.19/0.39 cnf(i_0_52, plain, (~'E'(s('0'),f(suc(suc(suc(X1)))))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.19/0.39 cnf(i_0_34, plain, ('E'(f(X1),f(suc(suc(X1))))|~'E'(s(s(s('0'))),f(suc(suc(X1))))|~'E'(s(s(s('0'))),f(suc(X1)))|~'E'(s(s(s('0'))),f(X1)))).
% 0.19/0.39 cnf(i_0_47, plain, (~'E'(s(s('0')),f(suc(suc(suc(X1)))))|~'E'(s(s('0')),f(suc(suc(X1))))|~'E'(s(s('0')),f(suc(X1)))|~'E'(s(s('0')),f(X1)))).
% 0.19/0.39 cnf(i_0_54, plain, (~'E'(s(s(s('0'))),f(suc(suc(suc(X1)))))|~'E'(s(s(s('0'))),f(suc(suc(X1))))|~'E'(s(s(s('0'))),f(suc(X1)))|~'E'(s(s(s('0'))),f(X1)))).
% 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 6 steps
% 0.19/0.39 cnf(i_0_48, plain, (~'LE'(f(z),'0')), inference(start_rule)).
% 0.19/0.39 cnf(i_0_62, plain, (~'LE'(f(z),'0')), inference(extension_rule, [i_0_53])).
% 0.19/0.39 cnf(i_0_152, plain, ('E'('0',f(z))), inference(extension_rule, [i_0_39])).
% 0.19/0.39 cnf(i_0_153, plain, (~'LE'(f(z),s('0'))), inference(etableau_closure_rule, [i_0_153, ...])).
% 0.19/0.39 cnf(i_0_154, plain, ('E'(f(z),f(suc(z)))), inference(etableau_closure_rule, [i_0_154, ...])).
% 0.19/0.39 cnf(i_0_155, plain, (~'E'('0',f(suc(z)))), inference(etableau_closure_rule, [i_0_155, ...])).
% 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.40 # Child (28204) has found a proof.
% 0.19/0.40
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------