TSTP Solution File: SYO657-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYO657-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 : n015.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:00 EDT 2022

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYO657-1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 14:25:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.36  # No SInE strategy applied
% 0.12/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36  #
% 0.12/0.36  # Presaturation interreduction done
% 0.12/0.36  # Number of axioms: 20 Number of unprocessed: 20
% 0.12/0.36  # Tableaux proof search.
% 0.12/0.36  # APR header successfully linked.
% 0.12/0.36  # Hello from C++
% 0.12/0.36  # The folding up rule is enabled...
% 0.12/0.36  # Local unification is enabled...
% 0.12/0.36  # Any saturation attempts will use folding labels...
% 0.12/0.36  # 20 beginning clauses after preprocessing and clausification
% 0.12/0.36  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.12/0.36  # No conjectures.
% 0.12/0.36  # There are 20 start rule candidates:
% 0.12/0.36  # Found 2 unit axioms.
% 0.12/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36  # 20 start rule tableaux created.
% 0.12/0.36  # 18 extension rule candidate clauses
% 0.12/0.36  # 2 unit axiom clauses
% 0.12/0.36  
% 0.12/0.36  # Requested 8, 32 cores available to the main process.
% 0.12/0.38  # There were 4 total branch saturation attempts.
% 0.12/0.38  # There were 0 of these attempts blocked.
% 0.12/0.38  # There were 0 deferred branch saturation attempts.
% 0.12/0.38  # There were 0 free duplicated saturations.
% 0.12/0.38  # There were 4 total successful branch saturations.
% 0.12/0.38  # There were 0 successful branch saturations in interreduction.
% 0.12/0.38  # There were 0 successful branch saturations on the branch.
% 0.12/0.38  # There were 4 successful branch saturations after the branch.
% 0.12/0.38  # There were 4 total branch saturation attempts.
% 0.12/0.38  # There were 0 of these attempts blocked.
% 0.12/0.38  # There were 0 deferred branch saturation attempts.
% 0.12/0.38  # There were 0 free duplicated saturations.
% 0.12/0.38  # There were 4 total successful branch saturations.
% 0.12/0.38  # There were 0 successful branch saturations in interreduction.
% 0.12/0.38  # There were 0 successful branch saturations on the branch.
% 0.12/0.38  # There were 4 successful branch saturations after the branch.
% 0.12/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  # Begin clausification derivation
% 0.12/0.38  
% 0.12/0.38  # End clausification derivation
% 0.12/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38  cnf(i_0_23, plain, ('LE'(f(X1),s(s('0'))))).
% 0.12/0.38  cnf(i_0_35, plain, (~'LE'(f(z),'0'))).
% 0.12/0.38  cnf(i_0_28, plain, ('LE'(f(X1),'0')|'E'('0',f(X1))|~'LE'(f(X1),s('0')))).
% 0.12/0.38  cnf(i_0_33, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(X1)))|~'LE'(f(suc(X1)),s('0')))).
% 0.12/0.38  cnf(i_0_27, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_36, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(X1))))).
% 0.12/0.38  cnf(i_0_34, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(suc(X1))))|~'LE'(f(suc(suc(X1))),s('0')))).
% 0.12/0.38  cnf(i_0_31, plain, (iLEQ(suc(X1),suc(X1))|'E'(f(X1),f(suc(X1)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_29, plain, (iLEQ(suc(X1),suc(X1))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_24, plain, (iLEQ(suc(X1),suc(X1))|'E'(f(X1),f(suc(X1)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_22, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(suc(X1)))))).
% 0.12/0.38  cnf(i_0_38, plain, (iLEQ(suc(X1),suc(X1))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_21, plain, ('E'(f(X1),f(suc(X1)))|'E'(f(X2),f(suc(X2)))|~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_30, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X2),suc(X1))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(X1)))|~'E'('0',f(suc(X2)))|~'E'('0',f(X1))|~'E'('0',f(X2)))).
% 0.12/0.38  cnf(i_0_26, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_32, plain, (~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_37, plain, ('E'(f(X1),f(suc(X1)))|'E'(f(X2),f(suc(X2)))|~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_25, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X2),suc(X1))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(X1))|~'E'(s('0'),f(X2)))).
% 0.12/0.38  cnf(i_0_39, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_40, plain, (~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.38  # Begin printing tableau
% 0.12/0.38  # Found 8 steps
% 0.12/0.38  cnf(i_0_36, plain, ('LE'(f(z),s('0'))|'E'(s('0'),f(suc(z)))), inference(start_rule)).
% 0.12/0.38  cnf(i_0_51, plain, ('LE'(f(z),s('0'))), inference(extension_rule, [i_0_28])).
% 0.12/0.38  cnf(i_0_130, plain, ('LE'(f(z),'0')), inference(closure_rule, [i_0_35])).
% 0.12/0.38  cnf(i_0_131, plain, ('E'('0',f(z))), inference(extension_rule, [i_0_31])).
% 0.12/0.38  cnf(i_0_52, plain, ('E'(s('0'),f(suc(z)))), inference(etableau_closure_rule, [i_0_52, ...])).
% 0.12/0.38  cnf(i_0_143, plain, (iLEQ(suc(z),suc(z))), inference(etableau_closure_rule, [i_0_143, ...])).
% 0.12/0.38  cnf(i_0_144, plain, ('E'(f(z),f(suc(z)))), inference(etableau_closure_rule, [i_0_144, ...])).
% 0.12/0.38  cnf(i_0_145, plain, (~'E'('0',f(suc(z)))), inference(etableau_closure_rule, [i_0_145, ...])).
% 0.12/0.38  # End printing tableau
% 0.12/0.38  # SZS output end
% 0.12/0.38  # Branches closed with saturation will be marked with an "s"
% 0.12/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  # Begin clausification derivation
% 0.12/0.38  
% 0.12/0.38  # End clausification derivation
% 0.12/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38  cnf(i_0_23, plain, ('LE'(f(X1),s(s('0'))))).
% 0.12/0.38  cnf(i_0_35, plain, (~'LE'(f(z),'0'))).
% 0.12/0.38  cnf(i_0_28, plain, ('LE'(f(X1),'0')|'E'('0',f(X1))|~'LE'(f(X1),s('0')))).
% 0.12/0.38  cnf(i_0_33, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(X1)))|~'LE'(f(suc(X1)),s('0')))).
% 0.12/0.38  cnf(i_0_27, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_36, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(X1))))).
% 0.12/0.38  cnf(i_0_34, plain, ('LE'(f(X1),'0')|'E'('0',f(suc(suc(X1))))|~'LE'(f(suc(suc(X1))),s('0')))).
% 0.12/0.38  cnf(i_0_31, plain, (iLEQ(suc(X1),suc(X1))|'E'(f(X1),f(suc(X1)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_29, plain, (iLEQ(suc(X1),suc(X1))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X1)))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_24, plain, (iLEQ(suc(X1),suc(X1))|'E'(f(X1),f(suc(X1)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_22, plain, ('LE'(f(X1),s('0'))|'E'(s('0'),f(suc(suc(X1)))))).
% 0.12/0.38  cnf(i_0_38, plain, (iLEQ(suc(X1),suc(X1))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_21, plain, ('E'(f(X1),f(suc(X1)))|'E'(f(X2),f(suc(X2)))|~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_30, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X2),suc(X1))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(X1)))|~'E'('0',f(suc(X2)))|~'E'('0',f(X1))|~'E'('0',f(X2)))).
% 0.12/0.38  cnf(i_0_26, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_32, plain, (~iLEQ(suc(X1),suc(X2))|~'E'('0',f(suc(suc(X2))))|~'E'('0',f(suc(suc(X1))))|~'E'('0',f(suc(X2)))|~'E'('0',f(suc(X1)))|~'E'('0',f(X2))|~'E'('0',f(X1)))).
% 0.12/0.38  cnf(i_0_37, plain, ('E'(f(X1),f(suc(X1)))|'E'(f(X2),f(suc(X2)))|~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_25, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X2),suc(X1))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(X1))|~'E'(s('0'),f(X2)))).
% 0.12/0.38  cnf(i_0_39, plain, ('E'(f(X1),f(suc(X1)))|~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  cnf(i_0_40, plain, (~iLEQ(suc(X1),suc(X2))|~'E'(s('0'),f(suc(suc(X2))))|~'E'(s('0'),f(suc(suc(X1))))|~'E'(s('0'),f(suc(X2)))|~'E'(s('0'),f(suc(X1)))|~'E'(s('0'),f(X2))|~'E'(s('0'),f(X1)))).
% 0.12/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.38  # Begin printing tableau
% 0.12/0.38  # Found 8 steps
% 0.12/0.38  cnf(i_0_27, plain, ('LE'(f(z),s('0'))|'E'(s('0'),f(z))), inference(start_rule)).
% 0.12/0.38  cnf(i_0_49, plain, ('LE'(f(z),s('0'))), inference(extension_rule, [i_0_28])).
% 0.12/0.38  cnf(i_0_130, plain, ('LE'(f(z),'0')), inference(closure_rule, [i_0_35])).
% 0.12/0.38  cnf(i_0_131, plain, ('E'('0',f(z))), inference(extension_rule, [i_0_31])).
% 0.12/0.38  cnf(i_0_50, plain, ('E'(s('0'),f(z))), inference(etableau_closure_rule, [i_0_50, ...])).
% 0.12/0.38  cnf(i_0_143, plain, (iLEQ(suc(z),suc(z))), inference(etableau_closure_rule, [i_0_143, ...])).
% 0.12/0.38  cnf(i_0_144, plain, ('E'(f(z),f(suc(z)))), inference(etableau_closure_rule, [i_0_144, ...])).
% 0.12/0.38  cnf(i_0_145, plain, (~'E'('0',f(suc(z)))), inference(etableau_closure_rule, [i_0_145, ...])).
% 0.12/0.38  # End printing tableau
% 0.12/0.38  # SZS output end
% 0.12/0.38  # Branches closed with saturation will be marked with an "s"
% 0.12/0.38  # There were 4 total branch saturation attempts.
% 0.12/0.38  # There were 0 of these attempts blocked.
% 0.12/0.38  # There were 0 deferred branch saturation attempts.
% 0.12/0.38  # There were 0 free duplicated saturations.
% 0.12/0.38  # There were 4 total successful branch saturations.
% 0.12/0.38  # There were 0 successful branch saturations in interreduction.
% 0.12/0.38  # There were 0 successful branch saturations on the branch.
% 0.12/0.38  # There were 4 successful branch saturations after the branch.
% 0.12/0.38  # Child (16069) has found a proof.
% 0.12/0.38  
% 0.12/0.38  # Proof search is over...
% 0.12/0.38  # Freeing feature tree
%------------------------------------------------------------------------------