TSTP Solution File: HWC004-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWC004-1 : TPTP v8.1.0. Released v2.5.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 : n026.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 : Sat Jul 16 13:07:04 EDT 2022
% Result : Satisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWC004-1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/0.12 % 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 : n026.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 : Thu Jun 9 13:12:18 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: 10 Number of unprocessed: 10
% 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 # 10 beginning clauses after preprocessing and clausification
% 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.13/0.37 # No conjectures.
% 0.13/0.37 # There are 10 start rule candidates:
% 0.13/0.37 # Found 10 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 10 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 10 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6519 Satisfiable branch
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6520 Satisfiable branch
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6525 Satisfiable branch
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6521 Satisfiable branch
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6522 Satisfiable branch
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6523 Satisfiable branch
% 0.13/0.37 # Satisfiable branch found.
% 0.13/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Satisfiable 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_19, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_20, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_11, plain, (and(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(n0,n1)=n0)).
% 0.13/0.37 cnf(i_0_13, plain, (and(n1,n0)=n0)).
% 0.13/0.37 cnf(i_0_14, plain, (and(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_15, plain, (or(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_16, plain, (or(n0,n1)=n1)).
% 0.13/0.37 cnf(i_0_17, plain, (or(n1,n0)=n1)).
% 0.13/0.37 cnf(i_0_18, plain, (or(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_31, plain, (X1=X1)).
% 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_31, plain, (n0=n0), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (n0=n0), inference(extension_rule, [i_0_35])).
% 0.13/0.37 cnf(i_0_58, plain, (not(n0)!=n1), inference(closure_rule, [i_0_19])).
% 0.13/0.37 cnf(i_0_56, plain, (and(n0,not(n0))=and(n0,n1)), inference(extension_rule, [i_0_34])).
% 0.13/0.37 cnf(i_0_65, plain, (and(n0,n1)!=n0), inference(closure_rule, [i_0_12])).
% 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 # Satisfiable branch found.
% 0.13/0.37 # Satisfiable branch found.
% 0.13/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.13/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6524 Satisfiable branch
% 0.13/0.37 # SZS status Satisfiable 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_19, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_20, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_11, plain, (and(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(n0,n1)=n0)).
% 0.13/0.37 cnf(i_0_13, plain, (and(n1,n0)=n0)).
% 0.13/0.37 cnf(i_0_14, plain, (and(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_15, plain, (or(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_16, plain, (or(n0,n1)=n1)).
% 0.13/0.37 cnf(i_0_17, plain, (or(n1,n0)=n1)).
% 0.13/0.37 cnf(i_0_18, plain, (or(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_31, plain, (X1=X1)).
% 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_31, plain, (n0=n0), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (n0=n0), inference(extension_rule, [i_0_35])).
% 0.13/0.37 cnf(i_0_58, plain, (not(n0)!=n1), inference(closure_rule, [i_0_19])).
% 0.13/0.37 cnf(i_0_56, plain, (and(n0,not(n0))=and(n0,n1)), inference(extension_rule, [i_0_34])).
% 0.13/0.37 cnf(i_0_65, plain, (and(n0,n1)!=n0), inference(closure_rule, [i_0_12])).
% 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 # SZS status Satisfiable 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_19, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_20, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_11, plain, (and(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(n0,n1)=n0)).
% 0.13/0.37 cnf(i_0_13, plain, (and(n1,n0)=n0)).
% 0.13/0.37 cnf(i_0_14, plain, (and(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_15, plain, (or(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_16, plain, (or(n0,n1)=n1)).
% 0.13/0.37 cnf(i_0_17, plain, (or(n1,n0)=n1)).
% 0.13/0.37 cnf(i_0_18, plain, (or(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_31, plain, (X1=X1)).
% 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_31, plain, (n0=n0), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (n0=n0), inference(extension_rule, [i_0_35])).
% 0.13/0.37 cnf(i_0_58, plain, (not(n0)!=n1), inference(closure_rule, [i_0_19])).
% 0.13/0.37 cnf(i_0_56, plain, (and(n0,not(n0))=and(n0,n1)), inference(extension_rule, [i_0_34])).
% 0.13/0.37 cnf(i_0_65, plain, (and(n0,n1)!=n0), inference(closure_rule, [i_0_12])).
% 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 # Satisfiable branch found.
% 0.13/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Satisfiable 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_19, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_20, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_11, plain, (and(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(n0,n1)=n0)).
% 0.13/0.37 cnf(i_0_13, plain, (and(n1,n0)=n0)).
% 0.13/0.37 cnf(i_0_14, plain, (and(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_15, plain, (or(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_16, plain, (or(n0,n1)=n1)).
% 0.13/0.37 cnf(i_0_17, plain, (or(n1,n0)=n1)).
% 0.13/0.37 cnf(i_0_18, plain, (or(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_31, plain, (X1=X1)).
% 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_31, plain, (n0=n0), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (n0=n0), inference(extension_rule, [i_0_35])).
% 0.13/0.37 cnf(i_0_58, plain, (not(n0)!=n1), inference(closure_rule, [i_0_19])).
% 0.13/0.37 cnf(i_0_56, plain, (and(n0,not(n0))=and(n0,n1)), inference(extension_rule, [i_0_34])).
% 0.13/0.37 cnf(i_0_65, plain, (and(n0,n1)!=n0), inference(closure_rule, [i_0_12])).
% 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 # Satisfiable branch found.
% 0.13/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Satisfiable 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_19, plain, (not(n0)=n1)).
% 0.13/0.37 cnf(i_0_20, plain, (not(n1)=n0)).
% 0.13/0.37 cnf(i_0_11, plain, (and(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_12, plain, (and(n0,n1)=n0)).
% 0.13/0.37 cnf(i_0_13, plain, (and(n1,n0)=n0)).
% 0.13/0.37 cnf(i_0_14, plain, (and(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_15, plain, (or(n0,n0)=n0)).
% 0.13/0.37 cnf(i_0_16, plain, (or(n0,n1)=n1)).
% 0.13/0.37 cnf(i_0_17, plain, (or(n1,n0)=n1)).
% 0.13/0.37 cnf(i_0_18, plain, (or(n1,n1)=n1)).
% 0.13/0.37 cnf(i_0_31, plain, (X1=X1)).
% 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_31, plain, (n0=n0), inference(start_rule)).
% 0.13/0.37 cnf(i_0_48, plain, (n0=n0), inference(extension_rule, [i_0_35])).
% 0.13/0.37 cnf(i_0_58, plain, (not(n0)!=n1), inference(closure_rule, [i_0_19])).
% 0.13/0.37 cnf(i_0_56, plain, (and(n0,not(n0))=and(n0,n1)), inference(extension_rule, [i_0_34])).
% 0.13/0.37 cnf(i_0_65, plain, (and(n0,n1)!=n0), inference(closure_rule, [i_0_12])).
% 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 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # 6526 Satisfiable branch
% 0.13/0.37 # Child (6519) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------