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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : KRS173+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 : 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 : Sun Jul 17 03:00:45 EDT 2022

% Result   : CounterSatisfiable 0.15s 0.40s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : KRS173+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.15  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36  % Computer : n029.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jun  7 16:47:35 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.15/0.39  # No SInE strategy applied
% 0.15/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.39  #
% 0.15/0.39  # Presaturation interreduction done
% 0.15/0.39  # Number of axioms: 9 Number of unprocessed: 9
% 0.15/0.39  # Tableaux proof search.
% 0.15/0.39  # APR header successfully linked.
% 0.15/0.39  # Hello from C++
% 0.15/0.39  # The folding up rule is enabled...
% 0.15/0.39  # Local unification is enabled...
% 0.15/0.39  # Any saturation attempts will use folding labels...
% 0.15/0.39  # 9 beginning clauses after preprocessing and clausification
% 0.15/0.39  # Creating start rules for all 2 conjectures.
% 0.15/0.39  # There are 2 start rule candidates:
% 0.15/0.39  # Found 2 unit axioms.
% 0.15/0.39  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.39  # 2 start rule tableaux created.
% 0.15/0.39  # 7 extension rule candidate clauses
% 0.15/0.39  # 2 unit axiom clauses
% 0.15/0.39  
% 0.15/0.39  # Requested 8, 32 cores available to the main process.
% 0.15/0.39  # There are not enough tableaux to fork, creating more from the initial 2
% 0.15/0.39  # Ran out of tableaux, making start rules for all clauses
% 0.15/0.39  # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.39  # We now have 11 tableaux to operate on
% 0.15/0.40  # 14607 Satisfiable branch
% 0.15/0.40  # 14609 Satisfiable branch
% 0.15/0.40  # Satisfiable branch found.
% 0.15/0.40  # Satisfiable branch found.
% 0.15/0.40  # There were 1 total branch saturation attempts.
% 0.15/0.40  # There were 0 of these attempts blocked.
% 0.15/0.40  # There were 0 deferred branch saturation attempts.
% 0.15/0.40  # There were 0 free duplicated saturations.
% 0.15/0.40  # There were 0 total successful branch saturations.
% 0.15/0.40  # There were 0 successful branch saturations in interreduction.
% 0.15/0.40  # There were 0 successful branch saturations on the branch.
% 0.15/0.40  # There were 0 successful branch saturations after the branch.
% 0.15/0.40  # There were 1 total branch saturation attempts.
% 0.15/0.40  # There were 0 of these attempts blocked.
% 0.15/0.40  # There were 0 deferred branch saturation attempts.
% 0.15/0.40  # There were 0 free duplicated saturations.
% 0.15/0.40  # There were 0 total successful branch saturations.
% 0.15/0.40  # There were 0 successful branch saturations in interreduction.
% 0.15/0.40  # There were 0 successful branch saturations on the branch.
% 0.15/0.40  # There were 0 successful branch saturations after the branch.
% 0.15/0.40  # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  # Begin clausification derivation
% 0.15/0.40  
% 0.15/0.40  # End clausification derivation
% 0.15/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40  cnf(i_0_8, plain, (cperson(ifred))).
% 0.15/0.40  cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.15/0.40  cnf(i_0_9, negated_conjecture, (xsd_string(esk3_0)|~rparent(ifred,i2003_11_14_17_14_14998)|~rparent(i2003_11_14_17_14_14998,i2003_11_14_17_14_14920)|~xsd_integer(esk3_0))).
% 0.15/0.40  cnf(i_0_10, negated_conjecture, (xsd_integer(esk3_0)|~rparent(ifred,i2003_11_14_17_14_14998)|~rparent(i2003_11_14_17_14_14998,i2003_11_14_17_14_14920)|~xsd_string(esk3_0))).
% 0.15/0.40  cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.15/0.40  cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.15/0.40  cnf(i_0_6, plain, (cperson(esk1_1(X1))|~cperson(X1))).
% 0.15/0.40  cnf(i_0_5, plain, (cperson(X1)|~rparent(X1,X2)|~cperson(X2))).
% 0.15/0.40  cnf(i_0_7, plain, (rparent(X1,esk1_1(X1))|~cperson(X1))).
% 0.15/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.15/0.40  # Begin printing tableau
% 0.15/0.40  # Found 3 steps
% 0.15/0.40  cnf(i_0_8, plain, (cperson(ifred)), inference(start_rule)).
% 0.15/0.40  cnf(i_0_171, plain, (cperson(ifred)), inference(extension_rule, [i_0_6])).
% 0.15/0.40  cnf(i_0_196, plain, (cperson(esk1_1(ifred))), inference(extension_rule, [i_0_6])).
% 0.15/0.40  # End printing tableau
% 0.15/0.40  # SZS output end
% 0.15/0.40  # Branches closed with saturation will be marked with an "s"
% 0.15/0.40  # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  # Begin clausification derivation
% 0.15/0.40  
% 0.15/0.40  # End clausification derivation
% 0.15/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40  cnf(i_0_8, plain, (cperson(ifred))).
% 0.15/0.40  cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.15/0.40  cnf(i_0_9, negated_conjecture, (xsd_string(esk3_0)|~rparent(ifred,i2003_11_14_17_14_14998)|~rparent(i2003_11_14_17_14_14998,i2003_11_14_17_14_14920)|~xsd_integer(esk3_0))).
% 0.15/0.40  cnf(i_0_10, negated_conjecture, (xsd_integer(esk3_0)|~rparent(ifred,i2003_11_14_17_14_14998)|~rparent(i2003_11_14_17_14_14998,i2003_11_14_17_14_14920)|~xsd_string(esk3_0))).
% 0.15/0.40  cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.15/0.40  cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.15/0.40  cnf(i_0_6, plain, (cperson(esk1_1(X1))|~cperson(X1))).
% 0.15/0.40  cnf(i_0_5, plain, (cperson(X1)|~rparent(X1,X2)|~cperson(X2))).
% 0.15/0.40  cnf(i_0_7, plain, (rparent(X1,esk1_1(X1))|~cperson(X1))).
% 0.15/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.15/0.40  # Begin printing tableau
% 0.15/0.40  # Found 4 steps
% 0.15/0.40  cnf(i_0_6, plain, (cperson(esk1_1(ifred))|~cperson(ifred)), inference(start_rule)).
% 0.15/0.40  cnf(i_0_186, plain, (~cperson(ifred)), inference(closure_rule, [i_0_8])).
% 0.15/0.40  cnf(i_0_185, plain, (cperson(esk1_1(ifred))), inference(extension_rule, [i_0_6])).
% 0.15/0.40  cnf(i_0_234, plain, (cperson(esk1_1(esk1_1(ifred)))), inference(extension_rule, [i_0_6])).
% 0.15/0.40  # End printing tableau
% 0.15/0.40  # SZS output end
% 0.15/0.40  # Branches closed with saturation will be marked with an "s"
% 0.15/0.40  # Child (14607) has found a proof.
% 0.15/0.40  
% 0.15/0.40  # Proof search is over...
% 0.15/0.40  # Freeing feature tree
%------------------------------------------------------------------------------