TSTP Solution File: SWV551-1.007 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV551-1.007 : TPTP v8.1.0. Released v4.0.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 : Wed Jul 20 18:22:31 EDT 2022
% Result : Satisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV551-1.007 : TPTP v8.1.0. Released v4.0.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.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 04:34:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 32 Number of unprocessed: 32
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 32 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 31 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 1 extension rule candidate clauses
% 0.12/0.37 # 31 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 39 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 39 tableaux to operate on
% 0.12/0.38 # 24835 Satisfiable branch
% 0.12/0.38 # 24834 Satisfiable branch
% 0.12/0.38 # 24836 Satisfiable branch
% 0.12/0.38 # 24837 Satisfiable branch
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 0 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 0 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53)).
% 0.12/0.38 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)).
% 0.12/0.38 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)).
% 0.12/0.38 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)).
% 0.12/0.38 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)).
% 0.12/0.38 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)).
% 0.12/0.38 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)).
% 0.12/0.38 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)).
% 0.12/0.38 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)).
% 0.12/0.38 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)).
% 0.12/0.38 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)).
% 0.12/0.38 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)).
% 0.12/0.38 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)).
% 0.12/0.38 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)).
% 0.12/0.38 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)).
% 0.12/0.38 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)).
% 0.12/0.38 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)).
% 0.12/0.38 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)).
% 0.12/0.38 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)).
% 0.12/0.38 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)).
% 0.12/0.38 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)).
% 0.12/0.38 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)).
% 0.12/0.38 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)).
% 0.12/0.38 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)).
% 0.12/0.38 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)).
% 0.12/0.38 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)).
% 0.12/0.38 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)).
% 0.12/0.38 cnf(i_0_47, hypothesis, (store(a_49,i7,e_52)=a_53)).
% 0.12/0.38 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)).
% 0.12/0.38 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (a1!=a2)).
% 0.12/0.38 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.12/0.38 cnf(i_0_70, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 6 steps
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)).
% 0.12/0.38 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_75])).
% 0.12/0.38 cnf(i_0_124, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_123, plain, (select(a_55,a_55)=select(a_53,a_53)), inference(extension_rule, [i_0_74])).
% 0.12/0.38 cnf(i_0_177, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_178, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # 24838 Satisfiable branch
% 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53)).
% 0.12/0.38 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)).
% 0.12/0.38 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)).
% 0.12/0.38 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)).
% 0.12/0.38 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)).
% 0.12/0.38 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)).
% 0.12/0.38 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)).
% 0.12/0.38 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)).
% 0.12/0.38 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)).
% 0.12/0.38 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)).
% 0.12/0.38 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)).
% 0.12/0.38 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)).
% 0.12/0.38 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)).
% 0.12/0.38 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)).
% 0.12/0.38 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)).
% 0.12/0.38 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)).
% 0.12/0.38 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)).
% 0.12/0.38 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)).
% 0.12/0.38 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)).
% 0.12/0.38 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)).
% 0.12/0.38 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)).
% 0.12/0.38 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)).
% 0.12/0.38 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)).
% 0.12/0.38 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)).
% 0.12/0.38 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)).
% 0.12/0.38 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)).
% 0.12/0.38 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)).
% 0.12/0.38 cnf(i_0_47, hypothesis, (store(a_49,i7,e_52)=a_53)).
% 0.12/0.38 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)).
% 0.12/0.38 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (a1!=a2)).
% 0.12/0.38 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.12/0.38 cnf(i_0_70, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 6 steps
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)).
% 0.12/0.38 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_75])).
% 0.12/0.38 cnf(i_0_125, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_123, plain, (select(a_55,a_55)=select(a_53,a_53)), inference(extension_rule, [i_0_74])).
% 0.12/0.38 cnf(i_0_177, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_178, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # 24840 Satisfiable branch
% 0.12/0.38 # 24839 Satisfiable branch
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 0 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53)).
% 0.12/0.38 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)).
% 0.12/0.38 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)).
% 0.12/0.38 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)).
% 0.12/0.38 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)).
% 0.12/0.38 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)).
% 0.12/0.38 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)).
% 0.12/0.38 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)).
% 0.12/0.38 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)).
% 0.12/0.38 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)).
% 0.12/0.38 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)).
% 0.12/0.38 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)).
% 0.12/0.38 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)).
% 0.12/0.38 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)).
% 0.12/0.38 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)).
% 0.12/0.38 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)).
% 0.12/0.38 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)).
% 0.12/0.38 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)).
% 0.12/0.38 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)).
% 0.12/0.38 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)).
% 0.12/0.38 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)).
% 0.12/0.38 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)).
% 0.12/0.38 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)).
% 0.12/0.38 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)).
% 0.12/0.38 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)).
% 0.12/0.38 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)).
% 0.12/0.38 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)).
% 0.12/0.38 cnf(i_0_47, hypothesis, (store(a_49,i7,e_52)=a_53)).
% 0.12/0.38 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)).
% 0.12/0.38 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (a1!=a2)).
% 0.12/0.38 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.12/0.38 cnf(i_0_70, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 6 steps
% 0.12/0.38 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)).
% 0.12/0.38 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_74])).
% 0.12/0.38 cnf(i_0_120, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_121, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 cnf(i_0_119, plain, (store(a_55,a_55,a_55)=store(a_53,a_53,a_53)), inference(extension_rule, [i_0_75])).
% 0.12/0.38 cnf(i_0_189, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (24834) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------