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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN346-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 : n006.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:10 EDT 2022

% Result   : Unsatisfiable 0.11s 0.35s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN346-1 : TPTP v8.1.0. Released v1.2.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.11/0.32  % Computer : n006.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 : Mon Jul 11 18:44:05 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.35  # No SInE strategy applied
% 0.11/0.35  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.35  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.35  #
% 0.11/0.35  # Presaturation interreduction done
% 0.11/0.35  # Number of axioms: 4 Number of unprocessed: 4
% 0.11/0.35  # Tableaux proof search.
% 0.11/0.35  # APR header successfully linked.
% 0.11/0.35  # Hello from C++
% 0.11/0.35  # The folding up rule is enabled...
% 0.11/0.35  # Local unification is enabled...
% 0.11/0.35  # Any saturation attempts will use folding labels...
% 0.11/0.35  # 4 beginning clauses after preprocessing and clausification
% 0.11/0.35  # Creating start rules for all 4 conjectures.
% 0.11/0.35  # There are 4 start rule candidates:
% 0.11/0.35  # Found 2 unit axioms.
% 0.11/0.35  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.11/0.35  # Found closed tableau while making start rule
% 0.11/0.35  # There were 0 total branch saturation attempts.
% 0.11/0.35  # There were 0 of these attempts blocked.
% 0.11/0.35  # There were 0 deferred branch saturation attempts.
% 0.11/0.35  # There were 0 free duplicated saturations.
% 0.11/0.35  # There were 0 total successful branch saturations.
% 0.11/0.35  # There were 0 successful branch saturations in interreduction.
% 0.11/0.35  # There were 0 successful branch saturations on the branch.
% 0.11/0.35  # There were 0 successful branch saturations after the branch.
% 0.11/0.35  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35  # Begin clausification derivation
% 0.11/0.35  
% 0.11/0.35  # End clausification derivation
% 0.11/0.35  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.35  cnf(i_0_5, negated_conjecture, (f(b,z1(X1,X2)))).
% 0.11/0.35  cnf(i_0_6, negated_conjecture, (f(X1,z2(X1,X2)))).
% 0.11/0.35  cnf(i_0_8, negated_conjecture, (~f(b,z2(X1,X2))|~f(X2,z2(X1,X2)))).
% 0.11/0.35  cnf(i_0_7, negated_conjecture, (~f(X1,z1(X2,X1))|~f(X2,z1(X2,X1)))).
% 0.11/0.35  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.11/0.35  # Begin printing tableau
% 0.11/0.35  # Found 3 steps
% 0.11/0.35  cnf(i_0_7, negated_conjecture, (~f(b,z1(b,b))|~f(b,z1(b,b))), inference(start_rule)).
% 0.11/0.35  cnf(i_0_9, plain, (~f(b,z1(b,b))), inference(closure_rule, [i_0_5])).
% 0.11/0.35  cnf(i_0_10, plain, (~f(b,z1(b,b))), inference(closure_rule, [i_0_5])).
% 0.11/0.35  # End printing tableau
% 0.11/0.35  # SZS output end
% 0.11/0.35  # Branches closed with saturation will be marked with an "s"
% 0.11/0.35  # NOT attempting initial tableau saturation
% 0.11/0.35  # 1 start rule tableaux created.
% 0.11/0.35  # 2 extension rule candidate clauses
% 0.11/0.35  # 2 unit axiom clauses
% 0.11/0.35  
% 0.11/0.35  # Proof search is over...
% 0.11/0.35  # Freeing feature tree
%------------------------------------------------------------------------------