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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWV011-1 : TPTP v8.1.0. Released v2.4.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 : n029.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 : Wed Jul 20 18:18:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SWV011-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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.32  % Computer : n029.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Wed Jun 15 19:47:57 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.12/0.34  # No SInE strategy applied
% 0.12/0.34  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.34  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.34  #
% 0.12/0.34  # Presaturation interreduction done
% 0.12/0.34  # Number of axioms: 3 Number of unprocessed: 3
% 0.12/0.34  # Tableaux proof search.
% 0.12/0.34  # APR header successfully linked.
% 0.12/0.34  # Hello from C++
% 0.12/0.34  # The folding up rule is enabled...
% 0.12/0.34  # Local unification is enabled...
% 0.12/0.34  # Any saturation attempts will use folding labels...
% 0.12/0.34  # 3 beginning clauses after preprocessing and clausification
% 0.12/0.34  # Creating start rules for all 1 conjectures.
% 0.12/0.34  # There are 1 start rule candidates:
% 0.12/0.34  # Found 2 unit axioms.
% 0.12/0.34  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.12/0.34  # Found closed tableau while making start rule
% 0.12/0.34  # There were 0 total branch saturation attempts.
% 0.12/0.34  # There were 0 of these attempts blocked.
% 0.12/0.34  # There were 0 deferred branch saturation attempts.
% 0.12/0.34  # There were 0 free duplicated saturations.
% 0.12/0.34  # There were 0 total successful branch saturations.
% 0.12/0.34  # There were 0 successful branch saturations in interreduction.
% 0.12/0.34  # There were 0 successful branch saturations on the branch.
% 0.12/0.34  # There were 0 successful branch saturations after the branch.
% 0.12/0.34  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  # Begin clausification derivation
% 0.12/0.34  
% 0.12/0.34  # End clausification derivation
% 0.12/0.34  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.34  cnf(i_0_4, plain, (b_holds(key(generate_key(an_a_nonce),a)))).
% 0.12/0.34  cnf(i_0_5, plain, (a_holds(key(generate_key(an_a_nonce),b)))).
% 0.12/0.34  cnf(i_0_6, negated_conjecture, (~a_holds(key(X1,b))|~b_holds(key(X1,a)))).
% 0.12/0.34  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.34  # Begin printing tableau
% 0.12/0.34  # Found 3 steps
% 0.12/0.34  cnf(i_0_6, negated_conjecture, (~a_holds(key(generate_key(an_a_nonce),b))|~b_holds(key(generate_key(an_a_nonce),a))), inference(start_rule)).
% 0.12/0.34  cnf(i_0_7, plain, (~a_holds(key(generate_key(an_a_nonce),b))), inference(closure_rule, [i_0_5])).
% 0.12/0.34  cnf(i_0_8, plain, (~b_holds(key(generate_key(an_a_nonce),a))), inference(closure_rule, [i_0_4])).
% 0.12/0.34  # End printing tableau
% 0.12/0.34  # SZS output end
% 0.12/0.34  # Branches closed with saturation will be marked with an "s"
% 0.12/0.34  # NOT attempting initial tableau saturation
% 0.12/0.34  # 1 start rule tableaux created.
% 0.12/0.34  # 1 extension rule candidate clauses
% 0.12/0.34  # 2 unit axiom clauses
% 0.12/0.34  
% 0.12/0.34  # Proof search is over...
% 0.12/0.34  # Freeing feature tree
%------------------------------------------------------------------------------