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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN352-1 : TPTP v8.1.0. Released v1.2.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 06:10:14 EDT 2022

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN352-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 19:39:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.37  # No SInE strategy applied
% 0.13/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37  #
% 0.13/0.37  # Presaturation interreduction done
% 0.13/0.37  # Number of axioms: 7 Number of unprocessed: 7
% 0.13/0.37  # Tableaux proof search.
% 0.13/0.37  # APR header successfully linked.
% 0.13/0.37  # Hello from C++
% 0.13/0.37  # The folding up rule is enabled...
% 0.13/0.37  # Local unification is enabled...
% 0.13/0.37  # Any saturation attempts will use folding labels...
% 0.13/0.37  # 7 beginning clauses after preprocessing and clausification
% 0.13/0.37  # Creating start rules for all 7 conjectures.
% 0.13/0.37  # There are 7 start rule candidates:
% 0.13/0.37  # Found 1 unit axioms.
% 0.13/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37  # 7 start rule tableaux created.
% 0.13/0.37  # 6 extension rule candidate clauses
% 0.13/0.37  # 1 unit axiom clauses
% 0.13/0.37  
% 0.13/0.37  # Requested 8, 32 cores available to the main process.
% 0.13/0.37  # There are not enough tableaux to fork, creating more from the initial 7
% 0.13/0.37  # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37  # We now have 18 tableaux to operate on
% 0.13/0.37  # There were 3 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 1 free duplicated saturations.
% 0.13/0.37  # There were 3 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 2 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_8, negated_conjecture, (f(a,b))).
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (~f(X1,z(X2,X1))|~f(X2,z(X2,X1))|~f(X2,X1))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(X1,X2))).
% 0.13/0.37  cnf(i_0_9, negated_conjecture, (f(b,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.37  cnf(i_0_12, negated_conjecture, (f(z(X1,X2),z(X1,X2))|~f(b,z(X1,X2))|~f(X1,z(X1,X2)))).
% 0.13/0.37  cnf(i_0_14, negated_conjecture, (f(X1,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(b,z(X1,X2))|f(X1,z(X1,X2)))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 7 steps
% 0.13/0.37  cnf(i_0_13, negated_conjecture, (~f(b,z(a,b))|~f(a,z(a,b))|~f(a,b)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_31, plain, (~f(a,b)), inference(closure_rule, [i_0_8])).
% 0.13/0.38  cnf(i_0_29, plain, (~f(b,z(a,b))), inference(extension_rule, [i_0_10])).
% 0.13/0.38  cnf(i_0_96, plain, (f(z(b,z(a,b)),z(b,z(a,b)))), inference(extension_rule, [i_0_14])).
% 0.13/0.38  cnf(i_0_30, plain, (~f(a,z(a,b))), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.13/0.38  cnf(i_0_101, plain, (f(z(b,z(a,b)),z(z(b,z(a,b)),z(b,z(a,b))))), inference(etableau_closure_rule, [i_0_101, ...])).
% 0.13/0.38  cnf(i_0_102, plain, (f(z(b,z(a,b)),z(z(b,z(a,b)),z(b,z(a,b))))), inference(etableau_closure_rule, [i_0_102, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # There were 4 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 4 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 4 successful branch saturations after the branch.
% 0.13/0.38  # There were 3 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 3 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 3 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_8, negated_conjecture, (f(a,b))).
% 0.13/0.38  cnf(i_0_13, negated_conjecture, (~f(X1,z(X2,X1))|~f(X2,z(X2,X1))|~f(X2,X1))).
% 0.13/0.38  cnf(i_0_10, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(X1,X2))).
% 0.13/0.38  cnf(i_0_9, negated_conjecture, (f(b,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (f(z(X1,X2),z(X1,X2))|~f(b,z(X1,X2))|~f(X1,z(X1,X2)))).
% 0.13/0.38  cnf(i_0_14, negated_conjecture, (f(X1,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_11, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(b,z(X1,X2))|f(X1,z(X1,X2)))).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 8 steps
% 0.13/0.38  cnf(i_0_14, negated_conjecture, (f(a,z(a,b))|f(b,z(a,b))|~f(a,b)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_20, plain, (~f(a,b)), inference(closure_rule, [i_0_8])).
% 0.13/0.38  cnf(i_0_18, plain, (f(a,z(a,b))), inference(extension_rule, [i_0_14])).
% 0.13/0.38  cnf(i_0_87, plain, (f(a,z(a,z(a,b)))), inference(extension_rule, [i_0_12])).
% 0.13/0.38  cnf(i_0_19, plain, (f(b,z(a,b))), inference(etableau_closure_rule, [i_0_19, ...])).
% 0.13/0.38  cnf(i_0_88, plain, (f(z(a,b),z(a,z(a,b)))), inference(etableau_closure_rule, [i_0_88, ...])).
% 0.13/0.38  cnf(i_0_93, plain, (f(z(a,z(a,b)),z(a,z(a,b)))), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.13/0.38  cnf(i_0_94, plain, (~f(b,z(a,z(a,b)))), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_8, negated_conjecture, (f(a,b))).
% 0.13/0.38  cnf(i_0_13, negated_conjecture, (~f(X1,z(X2,X1))|~f(X2,z(X2,X1))|~f(X2,X1))).
% 0.13/0.38  cnf(i_0_10, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(X1,X2))).
% 0.13/0.38  cnf(i_0_9, negated_conjecture, (f(b,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (f(z(X1,X2),z(X1,X2))|~f(b,z(X1,X2))|~f(X1,z(X1,X2)))).
% 0.13/0.38  cnf(i_0_14, negated_conjecture, (f(X1,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_11, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(b,z(X1,X2))|f(X1,z(X1,X2)))).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 6 steps
% 0.13/0.38  cnf(i_0_8, negated_conjecture, (f(a,b)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_32, plain, (f(a,b)), inference(extension_rule, [i_0_14])).
% 0.13/0.38  cnf(i_0_87, plain, (f(a,z(a,b))), inference(extension_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_88, plain, (f(b,z(a,b))), inference(etableau_closure_rule, [i_0_88, ...])).
% 0.13/0.38  cnf(i_0_96, plain, (f(b,z(a,z(a,b)))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.13/0.38  cnf(i_0_97, plain, (f(z(a,b),z(a,z(a,b)))), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # There were 3 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 3 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 3 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_8, negated_conjecture, (f(a,b))).
% 0.13/0.38  cnf(i_0_13, negated_conjecture, (~f(X1,z(X2,X1))|~f(X2,z(X2,X1))|~f(X2,X1))).
% 0.13/0.38  cnf(i_0_10, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(X1,X2))).
% 0.13/0.38  cnf(i_0_9, negated_conjecture, (f(b,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (f(z(X1,X2),z(X1,X2))|~f(b,z(X1,X2))|~f(X1,z(X1,X2)))).
% 0.13/0.38  cnf(i_0_14, negated_conjecture, (f(X1,z(X1,X2))|f(X2,z(X1,X2))|~f(X1,X2))).
% 0.13/0.38  cnf(i_0_11, negated_conjecture, (f(z(X1,X2),z(X1,X2))|f(b,z(X1,X2))|f(X1,z(X1,X2)))).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 8 steps
% 0.13/0.38  cnf(i_0_9, negated_conjecture, (f(b,z(a,b))|f(b,z(a,b))|~f(a,b)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_26, plain, (~f(a,b)), inference(closure_rule, [i_0_8])).
% 0.13/0.38  cnf(i_0_24, plain, (f(b,z(a,b))), inference(extension_rule, [i_0_14])).
% 0.13/0.38  cnf(i_0_87, plain, (f(b,z(b,z(a,b)))), inference(extension_rule, [i_0_12])).
% 0.13/0.38  cnf(i_0_95, plain, (~f(b,z(b,z(a,b)))), inference(closure_rule, [i_0_87])).
% 0.13/0.38  cnf(i_0_25, plain, (f(b,z(a,b))), inference(etableau_closure_rule, [i_0_25, ...])).
% 0.13/0.38  cnf(i_0_88, plain, (f(z(a,b),z(b,z(a,b)))), inference(etableau_closure_rule, [i_0_88, ...])).
% 0.13/0.38  cnf(i_0_93, plain, (f(z(b,z(a,b)),z(b,z(a,b)))), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # Child (26796) has found a proof.
% 0.13/0.38  
% 0.13/0.38  # Proof search is over...
% 0.13/0.38  # Freeing feature tree
%------------------------------------------------------------------------------