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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN347-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n007.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:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN347-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/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.33  % Computer : n007.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul 11 21:19:33 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.36  # No SInE strategy applied
% 0.11/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.36  #
% 0.11/0.36  # Presaturation interreduction done
% 0.11/0.36  # Number of axioms: 6 Number of unprocessed: 6
% 0.11/0.36  # Tableaux proof search.
% 0.11/0.36  # APR header successfully linked.
% 0.11/0.36  # Hello from C++
% 0.11/0.36  # The folding up rule is enabled...
% 0.11/0.36  # Local unification is enabled...
% 0.11/0.36  # Any saturation attempts will use folding labels...
% 0.11/0.36  # 6 beginning clauses after preprocessing and clausification
% 0.11/0.36  # Creating start rules for all 6 conjectures.
% 0.11/0.36  # There are 6 start rule candidates:
% 0.11/0.36  # Found 0 unit axioms.
% 0.11/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.36  # 6 start rule tableaux created.
% 0.11/0.36  # 6 extension rule candidate clauses
% 0.11/0.36  # 0 unit axiom clauses
% 0.11/0.36  
% 0.11/0.36  # Requested 8, 32 cores available to the main process.
% 0.11/0.36  # There are not enough tableaux to fork, creating more from the initial 6
% 0.11/0.36  # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.36  # We now have 12 tableaux to operate on
% 0.11/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36  # There were 4 total branch saturation attempts.
% 0.11/0.36  # There were 0 of these attempts blocked.
% 0.11/0.36  # There were 0 deferred branch saturation attempts.
% 0.11/0.36  # There were 1 free duplicated saturations.
% 0.11/0.36  # There were 4 total successful branch saturations.
% 0.11/0.36  # There were 0 successful branch saturations in interreduction.
% 0.11/0.36  # There were 0 successful branch saturations on the branch.
% 0.11/0.36  # There were 3 successful branch saturations after the branch.
% 0.11/0.36  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # Begin clausification derivation
% 0.11/0.36  
% 0.11/0.36  # End clausification derivation
% 0.11/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36  cnf(i_0_11, negated_conjecture, (f(b,y(X1,X2))|f(a,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_12, negated_conjecture, (~f(a,y(X1,X2))|~f(b,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_9, negated_conjecture, (~f(X1,y(X2,X1))|~f(X2,y(X2,X1))|~f(a,b))).
% 0.11/0.36  cnf(i_0_8, negated_conjecture, (f(X1,y(X2,X1))|f(a,b)|~f(X2,y(X2,X1)))).
% 0.11/0.36  cnf(i_0_7, negated_conjecture, (f(X1,y(X1,X2))|f(a,b)|~f(X2,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_10, negated_conjecture, (f(X1,y(X1,X2))|f(X2,y(X1,X2))|~f(a,b))).
% 0.11/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.11/0.36  # Begin printing tableau
% 0.11/0.36  # Found 10 steps
% 0.11/0.36  cnf(i_0_12, negated_conjecture, (~f(a,y(a,a))|~f(b,y(a,a))), inference(start_rule)).
% 0.11/0.36  cnf(i_0_111, plain, (~f(a,y(a,a))), inference(extension_rule, [i_0_7])).
% 0.11/0.36  cnf(i_0_963, plain, (f(a,b)), inference(extension_rule, [i_0_10])).
% 0.11/0.36  cnf(i_0_969, plain, (f(b,y(b,b))), inference(extension_rule, [i_0_12])).
% 0.11/0.36  cnf(i_0_968, plain, (f(b,y(b,b))), inference(extension_rule, [i_0_12])).
% 0.11/0.36  cnf(i_0_964, plain, (~f(a,y(a,a))), inference(extension_rule, [i_0_11])).
% 0.11/0.36  cnf(i_0_112, plain, (~f(b,y(a,a))), inference(etableau_closure_rule, [i_0_112, ...])).
% 0.11/0.36  cnf(i_0_990, plain, (~f(a,y(b,b))), inference(etableau_closure_rule, [i_0_990, ...])).
% 0.11/0.36  cnf(i_0_1006, plain, (~f(a,y(b,b))), inference(etableau_closure_rule, [i_0_1006, ...])).
% 0.11/0.36  cnf(i_0_1014, plain, (f(b,y(a,a))), inference(etableau_closure_rule, [i_0_1014, ...])).
% 0.11/0.36  # End printing tableau
% 0.11/0.36  # SZS output end
% 0.11/0.36  # Branches closed with saturation will be marked with an "s"
% 0.11/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36  # There were 3 total branch saturation attempts.
% 0.11/0.36  # There were 0 of these attempts blocked.
% 0.11/0.36  # There were 0 deferred branch saturation attempts.
% 0.11/0.36  # There were 0 free duplicated saturations.
% 0.11/0.36  # There were 3 total successful branch saturations.
% 0.11/0.36  # There were 0 successful branch saturations in interreduction.
% 0.11/0.36  # There were 0 successful branch saturations on the branch.
% 0.11/0.36  # There were 3 successful branch saturations after the branch.
% 0.11/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # Begin clausification derivation
% 0.11/0.36  
% 0.11/0.36  # End clausification derivation
% 0.11/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36  cnf(i_0_11, negated_conjecture, (f(b,y(X1,X2))|f(a,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_12, negated_conjecture, (~f(a,y(X1,X2))|~f(b,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_9, negated_conjecture, (~f(X1,y(X2,X1))|~f(X2,y(X2,X1))|~f(a,b))).
% 0.11/0.36  cnf(i_0_8, negated_conjecture, (f(X1,y(X2,X1))|f(a,b)|~f(X2,y(X2,X1)))).
% 0.11/0.36  cnf(i_0_7, negated_conjecture, (f(X1,y(X1,X2))|f(a,b)|~f(X2,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_10, negated_conjecture, (f(X1,y(X1,X2))|f(X2,y(X1,X2))|~f(a,b))).
% 0.11/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.11/0.36  # Begin printing tableau
% 0.11/0.36  # Found 6 steps
% 0.11/0.36  cnf(i_0_11, negated_conjecture, (f(b,y(b,b))|f(a,y(b,b))), inference(start_rule)).
% 0.11/0.36  cnf(i_0_27, plain, (f(b,y(b,b))), inference(extension_rule, [i_0_7])).
% 0.11/0.36  cnf(i_0_96, plain, (f(b,y(b,b))), inference(extension_rule, [i_0_12])).
% 0.11/0.36  cnf(i_0_28, plain, (f(a,y(b,b))), inference(etableau_closure_rule, [i_0_28, ...])).
% 0.11/0.36  cnf(i_0_97, plain, (f(a,b)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.11/0.36  cnf(i_0_108, plain, (~f(a,y(b,b))), inference(etableau_closure_rule, [i_0_108, ...])).
% 0.11/0.36  # End printing tableau
% 0.11/0.36  # SZS output end
% 0.11/0.36  # Branches closed with saturation will be marked with an "s"
% 0.11/0.36  # There were 3 total branch saturation attempts.
% 0.11/0.36  # There were 0 of these attempts blocked.
% 0.11/0.36  # There were 0 deferred branch saturation attempts.
% 0.11/0.36  # There were 0 free duplicated saturations.
% 0.11/0.36  # There were 3 total successful branch saturations.
% 0.11/0.36  # There were 0 successful branch saturations in interreduction.
% 0.11/0.36  # There were 0 successful branch saturations on the branch.
% 0.11/0.36  # There were 3 successful branch saturations after the branch.
% 0.11/0.36  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  # Begin clausification derivation
% 0.11/0.36  
% 0.11/0.36  # End clausification derivation
% 0.11/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36  cnf(i_0_11, negated_conjecture, (f(b,y(X1,X2))|f(a,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_12, negated_conjecture, (~f(a,y(X1,X2))|~f(b,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_9, negated_conjecture, (~f(X1,y(X2,X1))|~f(X2,y(X2,X1))|~f(a,b))).
% 0.11/0.36  cnf(i_0_8, negated_conjecture, (f(X1,y(X2,X1))|f(a,b)|~f(X2,y(X2,X1)))).
% 0.11/0.36  cnf(i_0_7, negated_conjecture, (f(X1,y(X1,X2))|f(a,b)|~f(X2,y(X1,X2)))).
% 0.11/0.36  cnf(i_0_10, negated_conjecture, (f(X1,y(X1,X2))|f(X2,y(X1,X2))|~f(a,b))).
% 0.11/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.11/0.36  # Begin printing tableau
% 0.11/0.36  # Found 9 steps
% 0.11/0.36  cnf(i_0_12, negated_conjecture, (~f(a,y(a,a))|~f(b,y(a,a))), inference(start_rule)).
% 0.11/0.36  cnf(i_0_25, plain, (~f(a,y(a,a))), inference(extension_rule, [i_0_10])).
% 0.11/0.36  cnf(i_0_94, plain, (f(a,y(a,a))), inference(closure_rule, [i_0_25])).
% 0.11/0.36  cnf(i_0_95, plain, (~f(a,b)), inference(extension_rule, [i_0_7])).
% 0.11/0.36  cnf(i_0_26, plain, (~f(b,y(a,a))), inference(etableau_closure_rule, [i_0_26, ...])).
% 0.11/0.36  cnf(i_0_98, plain, (~f(b,y(b,b))), inference(extension_rule, [i_0_11])).
% 0.11/0.36  cnf(i_0_96, plain, (f(b,y(b,b))), inference(extension_rule, [i_0_12])).
% 0.11/0.36  cnf(i_0_129, plain, (f(a,y(b,b))), inference(etableau_closure_rule, [i_0_129, ...])).
% 0.11/0.36  cnf(i_0_136, plain, (~f(a,y(b,b))), inference(etableau_closure_rule, [i_0_136, ...])).
% 0.11/0.36  # End printing tableau
% 0.11/0.36  # SZS output end
% 0.11/0.36  # Branches closed with saturation will be marked with an "s"
% 0.11/0.36  # Child (6683) has found a proof.
% 0.11/0.36  
% 0.11/0.36  # Proof search is over...
% 0.11/0.36  # Freeing feature tree
%------------------------------------------------------------------------------