↑ Up

Etableau---0.67.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWX206-1 : TPTP v9.3.0. Released v9.3.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 : n016.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  : 300s
% DateTime : Tue May  5 07:00:43 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX206-1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.18/0.34  % Computer : n016.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Tue May  5 11:34:36 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.21/0.37  # No SInE strategy applied
% 0.21/0.37  # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.21/0.37  # and selection function SelectNewComplexAHP.
% 0.21/0.37  #
% 0.21/0.37  # Presaturation interreduction done
% 0.21/0.37  # Number of axioms: 13 Number of unprocessed: 13
% 0.21/0.37  # Tableaux proof search.
% 0.21/0.37  # APR header successfully linked.
% 0.21/0.37  # Hello from C++
% 0.21/0.37  # The folding up rule is enabled...
% 0.21/0.37  # Local unification is enabled...
% 0.21/0.37  # Any saturation attempts will use folding labels...
% 0.21/0.37  # 13 beginning clauses after preprocessing and clausification
% 0.21/0.37  # Creating start rules for all 1 conjectures.
% 0.21/0.37  # There are 1 start rule candidates:
% 0.21/0.37  # Found 13 unit axioms.
% 0.21/0.37  # 1 start rule tableaux created.
% 0.21/0.37  # 0 extension rule candidate clauses
% 0.21/0.37  # 13 unit axiom clauses
% 0.21/0.37  
% 0.21/0.37  # Requested 8, 32 cores available to the main process.
% 0.21/0.37  # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.37  # Creating equality axioms
% 0.21/0.37  # Ran out of tableaux, making start rules for all clauses
% 0.21/0.37  # Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.37  # We now have 25 tableaux to operate on
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # Begin clausification derivation
% 0.21/0.38  
% 0.21/0.38  # End clausification derivation
% 0.21/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse)).
% 0.21/0.38  cnf(i_0_19, plain, (eq2(bfalse,btrue)=bfalse)).
% 0.21/0.38  cnf(i_0_15, plain, (impl(bfalse,X1)=btrue)).
% 0.21/0.38  cnf(i_0_14, plain, (impl(btrue,X1)=X1)).
% 0.21/0.38  cnf(i_0_16, plain, (x2(z,X1)=X1)).
% 0.21/0.38  cnf(i_0_24, plain, (eq(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_25, plain, (eq2(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_22, plain, (eq(z,s(X1))=bfalse)).
% 0.21/0.38  cnf(i_0_23, plain, (eq(s(X1),z)=bfalse)).
% 0.21/0.38  cnf(i_0_17, plain, (x2(s(X1),X2)=s(x2(X1,X2)))).
% 0.21/0.38  cnf(i_0_21, plain, (eq(s(X1),s(X2))=eq(X1,X2))).
% 0.21/0.38  cnf(i_0_18, plain, (impl(eq(x2(X1,X1),X1),bfalse)=plus_not_idem(X1))).
% 0.21/0.38  cnf(i_0_26, negated_conjecture, (eq2(plus_not_idem(X1),bfalse)!=btrue)).
% 0.21/0.38  cnf(i_0_28, plain, (X3=X3)).
% 0.21/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.38  # Begin printing tableau
% 0.21/0.38  # Found 6 steps
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)).
% 0.21/0.38  cnf(i_0_38, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_37])).
% 0.21/0.38  cnf(i_0_73, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_20])).
% 0.21/0.38  cnf(i_0_72, plain, (eq2(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_31])).
% 0.21/0.38  cnf(i_0_81, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_14])).
% 0.21/0.38  cnf(i_0_79, plain, (eq2(eq2(btrue,bfalse),eq2(btrue,bfalse))=impl(btrue,eq2(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.21/0.38  # End printing tableau
% 0.21/0.38  # SZS output end
% 0.21/0.38  # Branches closed with saturation will be marked with an "s"
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # Begin clausification derivation
% 0.21/0.38  
% 0.21/0.38  # End clausification derivation
% 0.21/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse)).
% 0.21/0.38  cnf(i_0_19, plain, (eq2(bfalse,btrue)=bfalse)).
% 0.21/0.38  cnf(i_0_15, plain, (impl(bfalse,X1)=btrue)).
% 0.21/0.38  cnf(i_0_14, plain, (impl(btrue,X1)=X1)).
% 0.21/0.38  cnf(i_0_16, plain, (x2(z,X1)=X1)).
% 0.21/0.38  cnf(i_0_24, plain, (eq(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_25, plain, (eq2(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_22, plain, (eq(z,s(X1))=bfalse)).
% 0.21/0.38  cnf(i_0_23, plain, (eq(s(X1),z)=bfalse)).
% 0.21/0.38  cnf(i_0_17, plain, (x2(s(X1),X2)=s(x2(X1,X2)))).
% 0.21/0.38  cnf(i_0_21, plain, (eq(s(X1),s(X2))=eq(X1,X2))).
% 0.21/0.38  cnf(i_0_18, plain, (impl(eq(x2(X1,X1),X1),bfalse)=plus_not_idem(X1))).
% 0.21/0.38  cnf(i_0_26, negated_conjecture, (eq2(plus_not_idem(X1),bfalse)!=btrue)).
% 0.21/0.38  cnf(i_0_28, plain, (X3=X3)).
% 0.21/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.38  # Begin printing tableau
% 0.21/0.38  # Found 6 steps
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)).
% 0.21/0.38  cnf(i_0_38, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_36])).
% 0.21/0.38  cnf(i_0_70, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_20])).
% 0.21/0.38  cnf(i_0_69, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_31])).
% 0.21/0.38  cnf(i_0_81, plain, (eq(bfalse,bfalse)!=impl(btrue,eq(bfalse,bfalse))), inference(closure_rule, [i_0_14])).
% 0.21/0.38  cnf(i_0_79, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=impl(btrue,eq(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.21/0.38  # End printing tableau
% 0.21/0.38  # SZS output end
% 0.21/0.38  # Branches closed with saturation will be marked with an "s"
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # Begin clausification derivation
% 0.21/0.38  
% 0.21/0.38  # End clausification derivation
% 0.21/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse)).
% 0.21/0.38  cnf(i_0_19, plain, (eq2(bfalse,btrue)=bfalse)).
% 0.21/0.38  cnf(i_0_15, plain, (impl(bfalse,X1)=btrue)).
% 0.21/0.38  cnf(i_0_14, plain, (impl(btrue,X1)=X1)).
% 0.21/0.38  cnf(i_0_16, plain, (x2(z,X1)=X1)).
% 0.21/0.38  cnf(i_0_24, plain, (eq(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_25, plain, (eq2(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_22, plain, (eq(z,s(X1))=bfalse)).
% 0.21/0.38  cnf(i_0_23, plain, (eq(s(X1),z)=bfalse)).
% 0.21/0.38  cnf(i_0_17, plain, (x2(s(X1),X2)=s(x2(X1,X2)))).
% 0.21/0.38  cnf(i_0_21, plain, (eq(s(X1),s(X2))=eq(X1,X2))).
% 0.21/0.38  cnf(i_0_18, plain, (impl(eq(x2(X1,X1),X1),bfalse)=plus_not_idem(X1))).
% 0.21/0.38  cnf(i_0_26, negated_conjecture, (eq2(plus_not_idem(X1),bfalse)!=btrue)).
% 0.21/0.38  cnf(i_0_28, plain, (X3=X3)).
% 0.21/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.38  # Begin printing tableau
% 0.21/0.38  # Found 6 steps
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)).
% 0.21/0.38  cnf(i_0_38, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_36])).
% 0.21/0.38  cnf(i_0_71, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_20])).
% 0.21/0.38  cnf(i_0_69, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_31])).
% 0.21/0.38  cnf(i_0_81, plain, (eq(bfalse,bfalse)!=impl(btrue,eq(bfalse,bfalse))), inference(closure_rule, [i_0_14])).
% 0.21/0.38  cnf(i_0_79, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=impl(btrue,eq(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.21/0.38  # End printing tableau
% 0.21/0.38  # SZS output end
% 0.21/0.38  # Branches closed with saturation will be marked with an "s"
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # Begin clausification derivation
% 0.21/0.38  
% 0.21/0.38  # End clausification derivation
% 0.21/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse)).
% 0.21/0.38  cnf(i_0_19, plain, (eq2(bfalse,btrue)=bfalse)).
% 0.21/0.38  cnf(i_0_15, plain, (impl(bfalse,X1)=btrue)).
% 0.21/0.38  cnf(i_0_14, plain, (impl(btrue,X1)=X1)).
% 0.21/0.38  cnf(i_0_16, plain, (x2(z,X1)=X1)).
% 0.21/0.38  cnf(i_0_24, plain, (eq(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_25, plain, (eq2(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_22, plain, (eq(z,s(X1))=bfalse)).
% 0.21/0.38  cnf(i_0_23, plain, (eq(s(X1),z)=bfalse)).
% 0.21/0.38  cnf(i_0_17, plain, (x2(s(X1),X2)=s(x2(X1,X2)))).
% 0.21/0.38  cnf(i_0_21, plain, (eq(s(X1),s(X2))=eq(X1,X2))).
% 0.21/0.38  cnf(i_0_18, plain, (impl(eq(x2(X1,X1),X1),bfalse)=plus_not_idem(X1))).
% 0.21/0.38  cnf(i_0_26, negated_conjecture, (eq2(plus_not_idem(X1),bfalse)!=btrue)).
% 0.21/0.38  cnf(i_0_28, plain, (X3=X3)).
% 0.21/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.38  # Begin printing tableau
% 0.21/0.38  # Found 5 steps
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)).
% 0.21/0.38  cnf(i_0_38, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_35])).
% 0.21/0.38  cnf(i_0_67, plain, (plus_not_idem(eq2(btrue,bfalse))=plus_not_idem(bfalse)), inference(extension_rule, [i_0_31])).
% 0.21/0.38  cnf(i_0_81, plain, (plus_not_idem(bfalse)!=impl(btrue,plus_not_idem(bfalse))), inference(closure_rule, [i_0_14])).
% 0.21/0.38  cnf(i_0_79, plain, (plus_not_idem(eq2(btrue,bfalse))=impl(btrue,plus_not_idem(bfalse))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.21/0.38  # End printing tableau
% 0.21/0.38  # SZS output end
% 0.21/0.38  # Branches closed with saturation will be marked with an "s"
% 0.21/0.38  # There were 1 total branch saturation attempts.
% 0.21/0.38  # There were 0 of these attempts blocked.
% 0.21/0.38  # There were 0 deferred branch saturation attempts.
% 0.21/0.38  # There were 0 free duplicated saturations.
% 0.21/0.38  # There were 1 total successful branch saturations.
% 0.21/0.38  # There were 0 successful branch saturations in interreduction.
% 0.21/0.38  # There were 0 successful branch saturations on the branch.
% 0.21/0.38  # There were 1 successful branch saturations after the branch.
% 0.21/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38  # Begin clausification derivation
% 0.21/0.38  
% 0.21/0.38  # End clausification derivation
% 0.21/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse)).
% 0.21/0.38  cnf(i_0_19, plain, (eq2(bfalse,btrue)=bfalse)).
% 0.21/0.38  cnf(i_0_15, plain, (impl(bfalse,X1)=btrue)).
% 0.21/0.38  cnf(i_0_14, plain, (impl(btrue,X1)=X1)).
% 0.21/0.38  cnf(i_0_16, plain, (x2(z,X1)=X1)).
% 0.21/0.38  cnf(i_0_24, plain, (eq(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_25, plain, (eq2(X1,X1)=btrue)).
% 0.21/0.38  cnf(i_0_22, plain, (eq(z,s(X1))=bfalse)).
% 0.21/0.38  cnf(i_0_23, plain, (eq(s(X1),z)=bfalse)).
% 0.21/0.38  cnf(i_0_17, plain, (x2(s(X1),X2)=s(x2(X1,X2)))).
% 0.21/0.38  cnf(i_0_21, plain, (eq(s(X1),s(X2))=eq(X1,X2))).
% 0.21/0.38  cnf(i_0_18, plain, (impl(eq(x2(X1,X1),X1),bfalse)=plus_not_idem(X1))).
% 0.21/0.38  cnf(i_0_26, negated_conjecture, (eq2(plus_not_idem(X1),bfalse)!=btrue)).
% 0.21/0.38  cnf(i_0_28, plain, (X3=X3)).
% 0.21/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.38  # Begin printing tableau
% 0.21/0.38  # Found 5 steps
% 0.21/0.38  cnf(i_0_20, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)).
% 0.21/0.38  cnf(i_0_38, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_34])).
% 0.21/0.38  cnf(i_0_65, plain, (s(eq2(btrue,bfalse))=s(bfalse)), inference(extension_rule, [i_0_31])).
% 0.21/0.38  cnf(i_0_81, plain, (s(bfalse)!=impl(btrue,s(bfalse))), inference(closure_rule, [i_0_14])).
% 0.21/0.38  cnf(i_0_79, plain, (s(eq2(btrue,bfalse))=impl(btrue,s(bfalse))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.21/0.38  # End printing tableau
% 0.21/0.38  # SZS output end
% 0.21/0.38  # Branches closed with saturation will be marked with an "s"
% 0.21/0.38  # Child (8511) has found a proof.
% 0.21/0.38  
% 0.21/0.38  # Proof search is over...
% 0.21/0.38  # Freeing feature tree
%------------------------------------------------------------------------------