TSTP Solution File: SWB002+2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWB002+2 : TPTP v8.1.0. Released v5.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 : n032.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 : Tue Jul 19 19:02:19 EDT 2022

% Result   : Theorem 0.15s 0.33s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWB002+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.11  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Wed Jun  1 11:36:59 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.15/0.33  # No SInE strategy applied
% 0.15/0.33  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.33  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.33  #
% 0.15/0.33  # Presaturation interreduction done
% 0.15/0.33  # Number of axioms: 3 Number of unprocessed: 3
% 0.15/0.33  # Tableaux proof search.
% 0.15/0.33  # APR header successfully linked.
% 0.15/0.33  # Hello from C++
% 0.15/0.33  # The folding up rule is enabled...
% 0.15/0.33  # Local unification is enabled...
% 0.15/0.33  # Any saturation attempts will use folding labels...
% 0.15/0.33  # 3 beginning clauses after preprocessing and clausification
% 0.15/0.33  # Creating start rules for all 1 conjectures.
% 0.15/0.33  # There are 1 start rule candidates:
% 0.15/0.33  # Found 2 unit axioms.
% 0.15/0.33  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.15/0.33  # Found closed tableau while making start rule
% 0.15/0.33  # There were 0 total branch saturation attempts.
% 0.15/0.33  # There were 0 of these attempts blocked.
% 0.15/0.33  # There were 0 deferred branch saturation attempts.
% 0.15/0.33  # There were 0 free duplicated saturations.
% 0.15/0.33  # There were 0 total successful branch saturations.
% 0.15/0.33  # There were 0 successful branch saturations in interreduction.
% 0.15/0.33  # There were 0 successful branch saturations on the branch.
% 0.15/0.33  # There were 0 successful branch saturations after the branch.
% 0.15/0.33  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.33  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.33  # Begin clausification derivation
% 0.15/0.33  
% 0.15/0.33  # End clausification derivation
% 0.15/0.33  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.33  cnf(i_0_3, plain, (iext(uri_ex_p,uri_ex_s,esk1_0))).
% 0.15/0.33  cnf(i_0_2, plain, (iext(uri_ex_q,esk1_0,uri_ex_s))).
% 0.15/0.33  cnf(i_0_1, negated_conjecture, (~iext(uri_ex_p,X1,X2)|~iext(uri_ex_q,X2,X1))).
% 0.15/0.33  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.15/0.33  # Begin printing tableau
% 0.15/0.33  # Found 3 steps
% 0.15/0.33  cnf(i_0_1, negated_conjecture, (~iext(uri_ex_p,uri_ex_s,esk1_0)|~iext(uri_ex_q,esk1_0,uri_ex_s)), inference(start_rule)).
% 0.15/0.33  cnf(i_0_4, plain, (~iext(uri_ex_p,uri_ex_s,esk1_0)), inference(closure_rule, [i_0_3])).
% 0.15/0.33  cnf(i_0_5, plain, (~iext(uri_ex_q,esk1_0,uri_ex_s)), inference(closure_rule, [i_0_2])).
% 0.15/0.33  # End printing tableau
% 0.15/0.33  # SZS output end
% 0.15/0.33  # Branches closed with saturation will be marked with an "s"
% 0.15/0.33  # NOT attempting initial tableau saturation
% 0.15/0.33  # 1 start rule tableaux created.
% 0.15/0.33  # 1 extension rule candidate clauses
% 0.15/0.33  # 2 unit axiom clauses
% 0.15/0.33  
% 0.15/0.33  # Proof search is over...
% 0.15/0.33  # Freeing feature tree
%------------------------------------------------------------------------------