TSTP Solution File: KRS169+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : KRS169+1 : TPTP v8.1.0. Released v3.1.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 : n028.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 : Sun Jul 17 03:00:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS169+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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 : n028.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 : Tue Jun  7 13:24:15 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: 8 Number of unprocessed: 8
% 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  # 8 beginning clauses after preprocessing and clausification
% 0.13/0.37  # Creating start rules for all 2 conjectures.
% 0.13/0.37  # There are 2 start rule candidates:
% 0.13/0.37  # Found 2 unit axioms.
% 0.13/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37  # 2 start rule tableaux created.
% 0.13/0.37  # 6 extension rule candidate clauses
% 0.13/0.37  # 2 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 2
% 0.13/0.37  # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37  # We now have 8 tableaux to operate on
% 0.13/0.37  # There were 2 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 0 free duplicated saturations.
% 0.13/0.37  # There were 2 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 Theorem 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_6, plain, (rhasLeader(iX,iY))).
% 0.13/0.37  cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.13/0.37  cnf(i_0_10, negated_conjecture, (xsd_string(esk2_0)|~rhasHead(iX,iY)|~xsd_integer(esk2_0))).
% 0.13/0.37  cnf(i_0_11, negated_conjecture, (xsd_integer(esk2_0)|~rhasHead(iX,iY)|~xsd_string(esk2_0))).
% 0.13/0.37  cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.13/0.37  cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.13/0.37  cnf(i_0_8, plain, (rhasLeader(X1,X2)|~rhasHead(X1,X2))).
% 0.13/0.37  cnf(i_0_9, plain, (rhasHead(X1,X2)|~rhasLeader(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 5 steps
% 0.13/0.37  cnf(i_0_6, plain, (rhasLeader(iX,iY)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_130, plain, (rhasLeader(iX,iY)), inference(extension_rule, [i_0_9])).
% 0.13/0.37  cnf(i_0_152, plain, (rhasHead(iX,iY)), inference(extension_rule, [i_0_11])).
% 0.13/0.37  cnf(i_0_168, plain, (xsd_integer(esk2_0)), inference(etableau_closure_rule, [i_0_168, ...])).
% 0.13/0.37  cnf(i_0_170, plain, (~xsd_string(esk2_0)), inference(etableau_closure_rule, [i_0_170, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Child (18870) has found a proof.
% 0.13/0.37  
% 0.13/0.37  # Proof search is over...
% 0.13/0.37  # Freeing feature tree
%------------------------------------------------------------------------------